Single source shortest path algorithm Dijkstra and Bellman-Ford Algorithms: A Comparative study
The “shortest path problem” is about finding a path between two vertices in a graph such that the total sum of the edges weights is minimum. Shortest-path problems are the most fundamental and the most commonly faced problems in the study of transportation and communication networks and In GIS Application [1, 2, and 5]. This is especially evident in the event that we sum up the class of “shortest path problems” to incorporate related problems, for example, the “longest-path problem”, the “most-reliable-path problems”, the “largest-capacity-path problem”, and various “routing problems”. Along these lines it isn't astounding that an enormous number of papers, reports, and expositions have been distributed regarding the matter of “shortest-path algorithms”. There have additionally seemed various astounding studies, review paper. There are many algorithms to find shortest path like Dijkstra, Bellman-ford, Floyd-Warshal, A*, Johnsons Algorithm, Viterbi Algorithm etc. In this paper we will discuss and examine Dijkstra and Bellman-ford algorithms and we will suggest by our study that in which situation which algorithm is best.
Copyright (c) 2020 International Journal of Computer Science and Emerging Technologies
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.