1. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1

2. 2 x x

3. 3

4. 4

5. 5

6. 6

7. 7

8. 8 x x

9. 9

10. 10

11. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 11

12. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 12 x

13. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 13

14. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 14

15. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 15

16. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 16 x

17. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 17 x

18. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 18

19. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 19 x

20. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 20

21. Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 21 x

22. Then the shortest path from a to z is a,c,b,d,e,z with length 13 22 Using Dijkstra’s Algorithm to Find a Shortest Path from a to z

23. 23