2. Determine the distance and the shortest route from A to K using the Djikstra Algorithm for the following graph 15 -> 12 52 25 9. 15 10 3 15 10 11 16 E

Write pseudo-code to modify Dijkstra algorithm to find the shortest path with the least number of hops. Demonstrate your approach to find that shortest path from vertex 1 to vertex 7 in the following graph. Show your work. I 1 1 2 2 3 8 1 4 3 3 5 6 5 4 4 7

Need output for: Distance S=0 &  Previous

PLEASE SHOW WRITTEN WORK ON PAPER!!! PLEASE HELP

9. Use the Dijkstra's algorithm to find the shortest path between the nodes A and Z in the diagram shown below: B 10 F 1 2 G 1 10 10 1 A 4 D 5 H Z 8 3 3 6 3 E 2 8

Dijkstra Algorithm

Use the shortest path algorithm to find the shortest path between vertex c and vertex m in Figure 4.1