Show the execution of Dijkstra’s algorithm on the directed weighted graph above

Question

Show the execution of Dijkstra’s algorithm on the directed weighted graph above with x as the source vertex. Show the intermediate stages of Dijkstra’s algorithm as shown in the graph. You only need to show the distance estimates v.d of vertices v ? V , not the current shortest path tree.

5. (10 points) Show the execution of Dijkstra's algorithm on the directed weighted graph in Fig 24.6 (pg. 659) with as the source vertex. Show the intermediate stages of Dijkstra's algorithm as in Fig. 24.6. You only need to show the distance estimates v.d of vertices v E V, not the current shortest path tree.

Explanation / Answer

CR in the first column means current vertex.

CR s t y x z 0 s 0 10 5 y 0 8 5 14 7 z 0 8 5 13 7 t 0 8 5 9 7 x 0 8 5 9 7

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.