Comparative Study for Trends of Solving Single Source Shortest Path Problems

Nilanshi Nigam, Vivek Bhushan, Abdul Muttalib
2016 International Journal of Computer Applications  
As the name suggests, Single source shortest path is a technique to find the shortest path corresponding to a source vertex. Single source can be implemented using greedy and dynamic approach. There are many approaches proposed for the same. The idea is to minimize the complexity of the algorithm. This paper presents a review of different algorithm proposed for this technique and compares the complexity and efficiency of each approach . It analyzes each algorithm and takes into account the
more » ... rent parameters involved and hence provide an overview of it. It helps us to know various advantages proposed by different algorithm.
doi:10.5120/ijca2016908832 fatcat:7rj2kb4335h5tbh62gzygd4gcu