ScholarLens Back to search
2012•World Automation CongressRequires access

An improved Dijkstra algorithm in GIS application

Xie De-xiang, Haibo Zhu, Lin Yan, Si Cong Yuan, Junqiao Zhang

Open publisher page 7 citations

Abstract

Network analyses is an important function of GIS, and the shortest path analysis is the key problem of network analyses. Dijkstra shortest path algorithm is one of the classic algorithms. Based on the analysis of this algorithm, this paper describe from the point of application, using geographic information system (GIS) features, we designed a new data storage structure, improved node search method to improve the efficiency of the algorithm by using a heap to save nodes, and that can save storage space and shorten the searching time.

About this research paper

What this paper is about

Network analyses is an important function of GIS, and the shortest path analysis is the key problem of network analyses. Dijkstra shortest path algorithm is one of the classic algorithms. Based on the analysis of this algorithm, this paper describe from the point of application, using geographic information system (GIS) features, we designed a new data storage structure, improved node search method to improve the efficiency of the algorithm by using a heap to save nodes, and that can save storage space and shorten the searching time.

Why it matters

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

Network analyses is an important function of GIS, and the shortest path analysis is the key problem of network analyses. Dijkstra shortest path algorithm is one of the classic algorithms. Based on the analysis of this algorithm, this paper describe from the point of application, using geographic information system (GIS) features, we designed a new data storage structure, improved node search method to improve the efficiency of the algorithm by using a heap to save nodes, and that can save storage space and shorten the searching time.

Key concepts: Dijkstra's algorithm, Pathfinding, Computer science, Yen's algorithm, Shortest path problem, K shortest path routing, Algorithm, Geographic information system

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An improved Dijkstra algorithm in GIS application — Research Paper | ScholarLens