| Dijkstra's: STEP 1 | Base Network [Prior] | Next [Step 2] | Final Step |
| Step 1. The MP tree starts at Node 1, which has two outbound links. The label for node 2 is updated as w(2) = Min [ w(2), w(1) + c(1,2) ] = Min [ ∞ , (0 + 1) ] = 1 (the predecessor node is set to 1). The label for node 5 is updated as w(5) = Min [ w(5), w(1) + c(1,5) ] = Min [ ∞ , (0 + 2) ] = 2 (the predecessor node is set to 1). |