| Dijkstra's: STEP 5 | Base Network | Prior [Step 4] | Next [Step 6] | Final Step |
| Step 5. Node 6 is added to the MP tree (the second node reached of the three nodes with the same minimum temporary label from Step 4). Outbound links from node 6 include links to nodes 7 and 10. Node 7 was already reached from from node 3 in step 4; the path through the current node 6 in longer so not updating occurs. Node 10 is reached for the first time; the corresponding temporary label is updated and the predecessor node is set to node 6. |