Some Interesting And Novel Results From Analysis Of Shortest Path Searching Algorithms

In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. It is very challenging and tough task for designing or modifying the parallel algorithms due to the time and space complexity. In this paper we studied a brief overview of different shortest path algorithms and its issues and applications in the different areas. We also describe the different techniques used for designing and its methodologies. Lastly we presented the complexity analysis for the different algorithms.