2010•Journal of Anyang Institute of TechnologyRequires access

Research and Application of Dijkstra Algorithm in GIS

Si Cheng

Abstract

Based on the classical Dijkstra algorithm, according to the actual road conditions ,and using the adjacency list as the road network stored structure, we applies Dijkstra Algorithm into GIS in order to reducing search times when finding the shortest path to the next one. We realize the application of shortest path queries in GIS based on the algorithm of Dijkstra.

About this research paper

What this paper is about

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

Key concepts: Dijkstra's algorithm, Pathfinding, Yen's algorithm, Shortest path problem, Adjacency list, A* search algorithm, K shortest path routing, Computer science