| Dijkstra's: STEP 2 | Base Network | Prior [Step 1] | Next [Step 3] | Final Step |
| Step 2. Node 6 is added (permanently labeled) to the MP tree. This is the minimum node label (node 6 is the only open node). Outbound links from node 6 include links to nodes 7 and 12; the corresponding temporary labels of these nodes are updated (e.g., w(7) = Min [ w(7), w(6) + c(6,7) ] = Min [ ∞, (1 + 1) ] = 2). |