| Dijkstra's: STEP 1 | Base Network [Prior] | Next [Step 2] | Final Step |
| Step 1. The MP tree starts at Centroid 5 that has only one outbound link. Note that the permanent label of the origin (Node 5) is set to zero and the temporary labels of all other nodes are set to ∞ (these are not shown on subsequent graphs). The label for node 6 is updated as w(6) = Min [ w(6), w(5) + c(5,6) ] = Min [ ∞, (0 + 1) ] = 1 |