| Dijkstra's: STEP 4 | Base Network | Prior [Step 3] | Next [Step 5] | Final Step |

| Step 4. Node 3 is added to the MP tree (there were three nodes with the same minimum temporary label; node 3 was selected since it was reached first). Outbound links from node 3 include links to nodes 4 and 7, both being reached for the first time. The corresponding temporary labels are updated and predecessor nodes are set to node 3. |