| Dijkstra's: STEP 16 | Base Network | Prior [Step 15] | Final Step |
| Step 16. Node 16 is added to the MP tree (the second of two nodes that had the same minimum temporary label). There are no outbound links to non-permanently labeled nodes so the step is complete. There are no remaining nodes with temporary labels so the algorithm is complete as is the MPT for Node 1. Results are depicted in the table below. |
| From \ To | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
| w(j) [t(1j)] | - | 1 | 4 | 9 | 2 | 4 | 6 | 8 | 4 | 7 | 7 | 9 | 6 | 10 | 8 | 10 |
| p(j) [pred(1j)] | - | 1 | 2 | 8 | 1 | 5 | 3 | 7 | 5 | 6 | 7 | 8 | 9 | 13 | 11 | 12 |