A Survey of Trilogy Shortest Path Algorithms
Keywords:Dijkstra; Shortest path; Floyd; Bellman
Shortest path problem is one of the most classical problem in graph theory, aiming to discover the shortest path between two nodes in a graph. In this problem, we have to find the minimum-cost tracks or shortest paths between the starting node and final destination in a given graph.Thiswork gives a brief introduction of the most famous algorithms of the shortest path problem i.e. Dijkstra’s, Bellman-Ford, and Floyd Warshall algorithm. A comparative analysis of these algorithms is performed based on their advantages, disadvantages, and efficiency, and application areas.
Copyright (c) 2021 Journal of Computational Learning Strategies & Practices
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
The journal is open access. Reading, downloading, copying, distributing and use of any material for academic and research purposes is free. The copyright in the Journal is owned by the CLSP. Unauthorized copying or redistribution for any financial or earning purpose will be violation of copyright laws. Moreover, managing editor is not responsible for originality of the articles accepted for the journal. However, the authors would be accountable if the ideas and the materials are found plagiarized. The journal is in the process of licensing under a Creative Commons Attribution- Non Commercial 4.0 International License. All articles published by JCLSP will be licensed under the Creative Commons Attribution 4.0 International License. This permits anyone to copy, redistribute, transmit and adapt the work provided the original work and source is appropriately cited as specified by the Creative Commons Attribution License.