Distributed processing of large-scale road networks for k-shortest path.

Large Graphs have been extensively used to represent complex data for both network and road data. Large-scale road networks consisting of millions of vertices and edges need more resources in the fields of hardware and computational time. There is also a need for tools that perform computations on graphs in parallel. We have introduced KSPGraphX to find the k shortest paths for large road networks using distributed processing.