| Dijkstra's: STEP 13 | Base Network | Prior [Step 12] | Next [Step 14] | Final Step |
| Step 13. Node 4 is added to the MP tree (there is a tie with nodes 4 and 12 having the same minimum temporary label; node 4 was reached first). There are no outbound links to non-permanently labeled nodes so the step is complete. |