Dijkstra algorithm in parallel- Case study
A Parallel Shortest Path Algorithm Based on Graph-Partitioning and Iterative Correcting