Shortest Path Algorithm

X is your starting point:

1. Place <X, [], 0> on READY.

2. Pick <N,P,L> on READY with minimum L.
   • Process it (record shortest path).

   • Remove it from READY, and mark PROCESSED.

   • Look up N's neighbours {N1, N2...Nk}, connected to N by edges with weights W1,W2,...Wk. Ignore those that are PROCESSED.

     For each UNPROCESSED neighbour Ni:

     • Create triple <Ni,(P^Ni),L+Wi>

     • Add triple to READY - if there is already a triple for Ni on READY, only add the new one (and delete the old one) if its path length is shorter.

3. Repeat step 2 until READY is empty.