Nearly identical to Prim's MST algorithm:
In Dijkstra, distance to ``outside'' node is the total distance from source instead of just the minimum length edge from the current tree.
![\begin{algorithm}
{Relax-Prim}{u,v,w}
\begin{IF}
{d[v]\gt w(u,v)}
d[v] \= w(u,v) \ \pi[v] \= u
\end{IF}\end{algorithm}](img17.gif)
