A novel single source shortest path algorithm
R. Uma Rani · Journal of Discrete Mathematical Sciences and Cryptography · 2009
This paper presents a new algorithm for computing shortest paths in a nearly directed graph G = (V, E). The existing Dijkstra’s algorithm finds the shortest distance between given two vertices. This paper proposes a new algorithm which proves to be better than Dijkstra’s and Floyd’s algorithm in certain cases. The proposed algorithm is a single source shortest path algorithm which finds the shortest path and shortest distance from a single vertex in a graph to all other vertices in the graph.