ScholarLens Back to search
2008•Computer Knowledge and TechnologyRequires access

A Compare between the Two Algorithm for Shortest Path

Chunyan Deng

Open publisher page 5 citations

Abstract

Dijkstra algorithm and Floyd algorithm are the two most commonly used as well as effective methods to compute the shortest path. In this paper, on the basis of the compare and analysis of Dijkstra algorithm and Floyd algorithm, the differences between the two algorithms in many aspects are shown, besides, the key part of the program by Floyd algorithm is given respectively. Furthermore, an improved algorithm based on Dijkstra algorithm is introduced.

About this research paper

What this paper is about

Dijkstra algorithm and Floyd algorithm are the two most commonly used as well as effective methods to compute the shortest path. In this paper, on the basis of the compare and analysis of Dijkstra algorithm and Floyd algorithm, the differences between the two algorithms in many aspects are shown, besides, the key part of the program by Floyd algorithm is given respectively. Furthermore, an improved algorithm based on Dijkstra algorithm is introduced.

Why it matters

OpenAlex reports 5 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

Dijkstra algorithm and Floyd algorithm are the two most commonly used as well as effective methods to compute the shortest path. In this paper, on the basis of the compare and analysis of Dijkstra algorithm and Floyd algorithm, the differences between the two algorithms in many aspects are shown, besides, the key part of the program by Floyd algorithm is given respectively. Furthermore, an improved algorithm based on Dijkstra algorithm is introduced.

Key concepts: Dijkstra's algorithm, Yen's algorithm, Computer science, Floyd–Warshall algorithm, Suurballe's algorithm, Shortest Path Faster Algorithm, Pathfinding, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Compare between the Two Algorithm for Shortest Path — Research Paper | ScholarLens