2011•Geomatics & Spatial Information TechnologyRequires access

The Dijkstra Algorithm Improved and its Application in the Traffic Navigation System Based on GIS

Zhiwei Zhang

Abstract

The analysis of shortest path is the most fundamental and important problem in GIS spatial analysis,the Dijkstra algorithm is the theoretical foundation to solve this problem effectively.Based on the features of GIS spatial analysis,this paper optimizes and improves the traditional Dijkstra algorithm from data storage structure,searching algorithm as well as network algorithm and so on.Finally it discusses the application of the algorithm in traffic navigation system.

About this research paper

What this paper is about

Why it matters

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

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