ScholarLens Back to search
2004•Computer and ModernizationRequires access

Application of Modified Dijkstra Algorithm in GIS Route Planning

Yushu Liu

Open publisher page 5 citations

Abstract

The shortest path algorithm is a hotspot in the field of Computer Science and geographic information science.This paper discusses a modified Dijkstra algorithm.According to the start point,routing point and target point that the user gives we can plan route in the traffic network graph in GIS,and build the shortest path which satisfies some restrictions with the algorithm.Actual application shows that the modified Dijkstra algorithm is feasible in enhancing the efficiency in network system spatial analysing.

About this research paper

What this paper is about

The shortest path algorithm is a hotspot in the field of Computer Science and geographic information science.This paper discusses a modified Dijkstra algorithm.According to the start point,routing point and target point that the user gives we can plan route in the traffic network graph in GIS,and build the shortest path which satisfies some restrictions with the algorithm.Actual application shows that the modified Dijkstra algorithm is feasible in enhancing the efficiency in network system spatial analysing.

Why it matters

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

The shortest path algorithm is a hotspot in the field of Computer Science and geographic information science.This paper discusses a modified Dijkstra algorithm.According to the start point,routing point and target point that the user gives we can plan route in the traffic network graph in GIS,and build the shortest path which satisfies some restrictions with the algorithm.Actual application shows that the modified Dijkstra algorithm is feasible in enhancing the efficiency in network system spatial analysing.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Application of Modified Dijkstra Algorithm in GIS Route Planning — Research Paper | ScholarLens