0
6.8kviews
Apply Dijkstras algorithm on the following graph

Apply Dijkstra’s algorithm on the following graph. Consider vertex 0 as the source.

1 Answer
6
582views

Dijkstra’s Algorithm

Dijkstra’s Algorithm is a type of Shortest Path Algorithm that is used to find the shortest path from the source vertex to every other vertex in the graph.


Algorithm of Dijkstra's

1] Let the distance of all other vertices from start = (infinity)

2] Repeat

  • Visit the …

Create a free account to keep reading this post.

and 3 others joined a min ago.

Please log in to add an answer.