Ask
Login
0
4.9kviews
To find Dijkstra shortest path from vertex 1 to vertex 4 for following graph.
written 8.7 years ago by gravatar for teamques10 teamques10 ★ 69k •   modified 5.0 years ago

enter image description here
analysis of algorithms
ADD COMMENT EDIT
1 Answer
0
318views
written 8.7 years ago by gravatar for teamques10 teamques10 ★ 69k
Source Vertex Distance with other vertices Path shown in graph
1 1– 2,path = 7
1 – 3,path = ∞
1 – 4,path = ∞
1 – 5,path = ∞
1 – 6,path = 3		 enter image description here
6 6 – 2,path = 3 + 2 = 5
6 – 3,path = 3 …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.