Dijkstra's: STEP 13 Base Network Prior [Step 12] Final Step

Step 13. Centroid 1 is added (permanently labeled) to the MP tree. Travel forecasting convention doesn't 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 (even if there had been outbound links). Furthermore, this is the last centroid in the network and, in transportation networks, the search stops when the last centroid is added to the MPT. The minimum path tree for origin node 5 is complete. The algorithm would be repeated with each other centroid as the home node, producing the table of interzonal minimum path travel times.

Last Updated: 5 March 2009 / ©mgm