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

1

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

2

x

x

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

3

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

4

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

5

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

6

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

7

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

8

x

x

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

9

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

10

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

11

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

12

x

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

13

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

14

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

15

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

16

x

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

17

x

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

18

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

19

x

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

20

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

21

x

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