An Efficient Scheme for the Single Source Shortest Path Problem based on Dijkstra and SPFA Methodologies
Gend Lal Prajapati, Pulkit Singhal, Ayush Ranjan, Neelesh Chourasia · International Journal of Computer Applications · 2017
This paper presents detailed comparisons and analysis of various single source shortest path algorithms.The paper proposes comparison among these algorithms on the basis of execution time taken by the algorithms to completely find the shortest path to all the nodes from a starting node.The algorithms have been analyzed on the various parameters: number of vertices, number of edges, and structure of the graph.This analysis will help in selecting the appropriate algorithm to be used in solving a particular real-life problem.This paper also proposes an algorithm that works efficiently over all types of the graph.