Page 1 of 1
Q3. Graph-Shortest Path [25 marks). A weighted graph G2 is shown in Fig. 2. With v1 as the source, show how Dijkstra's a
Posted: Wed Apr 27, 2022 3:41 pm
by answerhappygod
- Q3 Graph Shortest Path 25 Marks A Weighted Graph G2 Is Shown In Fig 2 With V1 As The Source Show How Dijkstra S A 1 (24.84 KiB) Viewed 30 times
Q3. Graph-Shortest Path [25 marks). A weighted graph G2 is shown in Fig. 2. With v1 as the source, show how Dijkstra's algorithm works (needs to keep the predecessor of each node) step by step. List the shortest path from 1 to 07 and its distance. 10 Vs 3 7 12 6 16 5 V 4 2 . 9 14 VO 8 Fig. 2. A weighted graph G2.