2005•Computer and ModernizationRequires access

Efficient Implementation of Dijkstra Algorithm in GIS

Jing Zhu

Abstract

The implementation of geographic information system (GIS) often concerns with seeking shortest path. Dijkstra algorithm presented by Dijkstra in 1959 is one of the most suitable algorithms for finding the shortest path between two nodes of graphic.This paper discusses the problem that how to locate the shortest path between two nodes in common traffic graphic,and presents the method of raising efficiency of Dijkstra algorithm.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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, Shortest path problem, Yen's algorithm, K shortest path routing, A* search algorithm, Shortest Path Faster Algorithm