ScholarLens Back to search
2012•Computer Development & ApplicationsRequires access

An Improved Algorithm of Dijkstra in GIS Field

Na Zhao

Open publisher page 0 citations

Abstract

It is an important part of the application of GIS of using the Dijkstra algorithm to search shortest path problem.The Dijkstra algorithm can not find all the shortest paths.An improved algorithm is presented in this article,which combines Dijkstra algorithm with some data structure and all shortest path from one vertex to other vertex can be be found easily.And this improved algorithm did not increase the complexity of the original algorithm,so it has good research and practical value.

About this research paper

What this paper is about

It is an important part of the application of GIS of using the Dijkstra algorithm to search shortest path problem.The Dijkstra algorithm can not find all the shortest paths.An improved algorithm is presented in this article,which combines Dijkstra algorithm with some data structure and all shortest path from one vertex to other vertex can be be found easily.And this improved algorithm did not increase the complexity of the original algorithm,so it has good research and practical value.

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

It is an important part of the application of GIS of using the Dijkstra algorithm to search shortest path problem.The Dijkstra algorithm can not find all the shortest paths.An improved algorithm is presented in this article,which combines Dijkstra algorithm with some data structure and all shortest path from one vertex to other vertex can be be found easily.And this improved algorithm did not increase the complexity of the original algorithm,so it has good research and practical value.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Improved Algorithm of Dijkstra in GIS Field — Research Paper | ScholarLens