ScholarLens Back to search
2014•International Journal of Research in Engineering and TechnologyOpen access

COMPARISON OF SHORTEST PATH ALGORITHMS USING C#

Swati Vishnoi .

Open full text 1 citations

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Shortest path problem, Path (computing), Algorithm, Computer science, Theoretical computer science, Computer network, Graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
COMPARISON OF SHORTEST PATH ALGORITHMS USING C# — Research Paper | ScholarLens