Dijkstra’s Algorithm

Dijkstra’s Algorithm

• Each node is labeled (in parentheses) with its distance from the source node along the best known path.

A

B

C

E

F

D

G

H

1

2

2

6

4

2

7

3

3

2

2

Previous slide

Next slide

Back to the first slide

View Graphic Version