c) Use Dijkstra's algorithm to find the shortest paths in the graph given in Fig. 3...

 

Transcribed Image Text:

c) Use Dijkstra's algorithm to find the shortest paths in the graph given in Fig. 3 with a as the source vertex. (6) 2 11 3 14, 1 4 5 18 g 11 2 Figure 3: Figure for exercise 6(c). c) Use Dijkstra's algorithm to find the shortest paths in the graph given in Fig. 3 with a as the source vertex. (6) 2 11 3 14, 1 4 5 18 g 11 2 Figure 3: Figure for exercise 6(c).