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