A Study and Analysis Among Dijkstra’s Algorithm, Bellman–Ford Algorithm and Floyd’s Algorithm on Run-Time Basis Using Source Code
DOI:
https://doi.org/10.37628/ijosct.v3i1.264Abstract
Numerous applications like communication network and transportation use shortest path algorithm to notice the shortest path between two nodes. In the Single source shortest path algorithm, a shortest path is calculating from one node to another node. In the present paper, I have compared the results of the shortest path algorithms (Dijkstra, Bellman–Ford) on the basis of running time. I am using C# programming language to compare the algorithms. I have also compared the algorithms on the basis of complexity and space. I also tried to give some advantages and disadvantages of both the algorithms.References
S. Vishnoi, H. Hasmi. 3rd International Conference on System Modeling and Advancement in Research Trends (SMART). Teerthanker Mahaveer University, Moradabad, 2014.
http://rebustechnologies.com/shortest-path-algorithm-comparison/“Shortest Path Algorithm Comparison Posted on December 5, 2011 By dchamber”.
http://en.algoritmy.net/article/45514/Dijkstras-algorithm.
http://en.algoritmy.net/article/47389/Bellman-Ford-algorithm.
9th DIMACS Implementation Challenge. Shortest Paths. http://www.dis.uniroma1.it/~challenge9/, 2006.
R.K. Ahuja, K. Mehlhorn, J.B. Orlin, R.E. Tarjan. Faster algo- rithms for the shortest path problem, J ACM. 1990; 37(2): 213–3p.
H. Bast, S. Funke, D. Matijevic. TRANSIT – ultrafast shortest – path queries with linear-time preprocessing, In: 9th DIMACS Implementation Challenge. 2006, 1p.
H. Bast, S. Funke, D. Matijevic, P. Sanders, D. Schultes. In transit to constant time shortest-path queries in road networks, In: Workshop on Algorithm Engineering and Experiments (ALENEX). 2007, 46–59p.
H. Bast, S. Funke, P. Sanders, D. Schultes. Fast routing in road networks with transit nodes, Science. 2007; 316(5824): 566p
