COMPARISON OF SHORTEST PATH ALGORITHMS USING C#

Swati Vishnoi, Hina Hashmi

Abstract: Many applications like transportation and communication network use shortest path algorithm to find out the shortest path between two or more nodes. In the Single source shortest path algorithm, a shortest path is calculated from one node to another node. In this paper, I have compared the results of the shortest path algorithms (Dijkstra, Bellman Ford) on the basis of running time. I used C# programming language to compare the algorithms. I compared the algorithms on the basis of complexity and space. I also tried to give some advantages and disadvantages of both the algorithms.

Keywords: Shortest Path, Dijkstra, Bellman Ford, Run-time Analysis

DOI: https://doi.org/10.15623/ijret.2014.0326018