ScholarLens Back to search
2021•Unpublished venueRequires access

Improved Dijkstra algorithm based on a new storage method

Junjie Wang, Yingqiao Liu, Bo Tang, Xiaoling Jin, Yang Xiao

Open publisher page 1 citations

Abstract

Shortest path algorithm is the basis of many optimization problems such as resource allocation and optimal path planning. It is very meaningful to study the shortest path algorithm, because it can reflect the efficiency. We propose an improved Dijkstra algorithm based on a new storage method, which improves the shortcomings of the Dijkstra algorithm to a certain extent by constructing the map of the forward star by the chain. The experimental results show that our improved algorithm is more effective than the classical algorithm. We provide an effective method for the analysis and application of actual large graph theory problems.

About this research paper

What this paper is about

Shortest path algorithm is the basis of many optimization problems such as resource allocation and optimal path planning. It is very meaningful to study the shortest path algorithm, because it can reflect the efficiency. We propose an improved Dijkstra algorithm based on a new storage method, which improves the shortcomings of the Dijkstra algorithm to a certain extent by constructing the map of the forward star by the chain. The experimental results show that our improved algorithm is more effective than the classical algorithm. We provide an effective method for the analysis and application of actual large graph theory problems.

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

Shortest path algorithm is the basis of many optimization problems such as resource allocation and optimal path planning. It is very meaningful to study the shortest path algorithm, because it can reflect the efficiency. We propose an improved Dijkstra algorithm based on a new storage method, which improves the shortcomings of the Dijkstra algorithm to a certain extent by constructing the map of the forward star by the chain. The experimental results show that our improved algorithm is more effective than the classical algorithm. We provide an effective method for the analysis and application of actual large graph theory problems.

Key concepts: Dijkstra's algorithm, Suurballe's algorithm, A* search algorithm, Yen's algorithm, Shortest Path Faster Algorithm, K shortest path routing, Shortest path problem, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improved Dijkstra algorithm based on a new storage method — Research Paper | ScholarLens