Dijkstra’s Algorithm (cont’d)

E(4, B)

Dijkstra’s Algorithm (cont’d)

We examine each of the nodes adjacent E, relabeling each one with the distance to E.

1

2

A

B(2, A)

C(9, B)

F(6, E)

D(Ą,-)

G(5, E)

H(Ą,-)

Previous slide Next slide Back to the first slide View Graphic Version