Dijkstra’s Algorithm (cont’d)
Dijkstra’s Algorithm (cont’d)
- We start out by marking node A (the working node) as permanent.
- We examine each of the nodes adjacent A, relabeling each one with the distance to A.
A
B(2, A)
C(¥,-)
E(¥,-)
F(¥,-)
D(¥,-)
G(6, A)
H(¥,-)
2
6