Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms.
Anu PradhanG. (Kumar) MahinthakumarPublished in: J. Comput. Civ. Eng. (2013)
Keyphrases
- shortest path
- shortest path algorithm
- road network
- travel time
- transportation networks
- minimum cost flow
- strongly connected components
- routing algorithm
- optimal path
- minimum spanning tree
- computational complexity
- weighted graph
- shortest path problem
- depth first search
- edge weights
- benchmark problems
- betweenness centrality
- moving objects