Question
5. Let G be the following weighted graph, where the number next to each edge is the weight of the edge. 1 a 2 C P 5 b 4 1 1 7 e 2 9 6 Figure 3: Question 5 Apply Dijkstra's algorithm to find the distance from a to all other vertices of G. State what the labels of vertices are when each new vertex is chosen to be added t
Question image 1