Dijkstra’s Algorithm (cont’d)

Dijkstra’s Algorithm (cont’d)

We want to find the shortest path from A to D.
Initially, no paths are known, so all nodes are labeled with infinity.

A

B(Ą,-)

C(Ą,-)

E(Ą,-)

F(Ą,-)

D(Ą,-)

G(Ą,-)

H(Ą,-)

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