next up previous index
Next: The iterative step Up: Dijkstra's algorithm Previous: Dijkstra's algorithm   Index

Initialisation

Set $S = \{s\}$ with $D(s)=0$. Set $S^{\ast}$ to be $S$ together with all nodes $u$ adjacent to $s$, and define $D(u)$ for such nodes to be the length of the shortest arc from $s$ to $u$.



Peter Williams 2005-06-07