To find the shortest path in a graph with non-negative edge weights, the ____ algorithm can be used.

  • Binary
  • Bubble
  • Dijkstra's
  • Quick
To find the shortest path in a graph with non-negative edge weights, you can use Dijkstra's algorithm. This algorithm efficiently calculates the shortest path from a source vertex to all other vertices in a weighted graph.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *