Implementation of Shortest Path Algorithms
DOI:
https://doi.org/10.32628/IJSRSET2411261Keywords:
Dijkstra’s Algorithm, Prim’s algorithm, Floyd-Warshall Algorithm, Kruskal’s AlgorithmAbstract
An important area of study that models the relationships between items is called graph theory. The shortest path between two objects is one of the most important concepts in graph theory. Many algorithms, such as Dijkstra's Algorithm, Prim’s Algorithm, Floyd Warshall Algorithm have been created for this purpose.
Downloads
References
Prim, R. C. (November 1957), "Shortest connection networks And some generalizations", Bell System Technical Journal, 36 (6): 1389–1401, Bibcode:1957BSTJ...36.1389P, doi:10.1002/j.1538-7305.1957.tb01515.x. 11. DOI: https://doi.org/10.1002/j.1538-7305.1957.tb01515.x
https://www.geeksforgeeks.org/
Survey of Shortest Path AlgorithmsSSN: 2321-1067, https://doi.org/10.58443/IJREX.10.11.2022.46-5 Sadhana H.Barkund
Dijkstra's algorithm". Introduction to Algorithms (Second Ed.). MIT Press and McGraw–Hill. pp. 595–601. ISBN 0-262-03293-7.
Floyd, Robert W. (June 1962). "Algorithm 97: Shortest Path". Communications of the ACM. 5 (6): 345. Doi:10.1145/367766.368168. DOI: https://doi.org/10.1145/367766.368168
Kruskal, J. B. (1956). "On the shortest spanning subtree of a graph and the traveling salesman problem ."Proceedings of the American Mathematical Society. 7 (1): 48–50. Doi: 10.1090/S0002-9939-1956-0078686-7. DOI: https://doi.org/10.1090/S0002-9939-1956-0078686-7
Downloads
Published
Issue
Section
License
Copyright (c) 2024 International Journal of Scientific Research in Science, Engineering and Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
