Dijkstra's: STEP 6 Base Network Prior [Step 5] Next [Step 7] Final Step

Step 6. Centroid 2 is added (permanently labeled) to the MP tree. Both centroid 2 and node 13 are equidistant from the origin node but since centroid 2 was added to the loose ends table first, it is selected first for the MP Tree. Travel forecasting convention does not allow minimum paths to pass through a centroid because centroid connectors are typically abstract representations of local streets and not actual links. Therefore, no further searching occurs from this node. Links from 12 to 10, 12 to 13, and 8 to 9 are still under consideration. Note: if the objective was to find the MP from centroid 5 to only centroid 2, then the algorithm would terminate.

Last Updated: 5 March 2009 / ©mgm