Parallel Domain Partitioning Shortest Path Algorithms

New Dijkstra shortest path (SP) algorithm that takes full advantage of DP algorithms developed in Chap. 7 is presented in this chapter. A small-scale numerical example of “10-node” transportation network is used to explain detailed steps to get the correct solution for Dijkstra SP algorithm by integrating its subdomains’ individual solutions. This chapter is ended with the solutions of several real-life (large-scale) transportation networks using the newly developed “parallel Dijkstra SP algorithm” with finite element based domain partitioning (DP) procedures.