Ask
Login
0
5.5kviews
Apply Dijkstras algorithm on the following graph
written 2.2 years ago by gravatar for yashashirs899 yashashirs899 • 40 modified 2.2 years ago by gravatar for binitamayekar binitamayekar ★ 6.4k

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

analysis of algorithms
ADD COMMENT EDIT
1 Answer
6
476views
written 2.2 years ago by gravatar for binitamayekar binitamayekar ★ 6.4k •   modified 2.2 years ago

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 = $\infty$ (infinity)

2] Repeat

  • Visit the …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.