Abstract: The shortest path and minimum spanning tree problems are two of the classic problems in combinatorial optimization. Using Dijkstra algorithm for searching shortest path problem is an important content of the application of GIS (Geographic Information System), but it fails to find all the shortest paths. In this work the article based on the Dijkstra algorithm, added some data structure and proposed an algorithm that calculates all the shortest path of one vertex to others, the data structure is relatively simple; while effectiveness of the algorithm is explain through a numerical example.
Keywords: Graph, Weighted graph,adjacent matrix, Disjkstra algorithm.
Title: Shortest Path Algorithms
Author: S.P. Behera, S. Bhattacharjee, D. Mishra
International Journal of Mathematics and Physical Sciences Research
ISSN 2348-5736 (Online)
Research Publish Journals
