An Improved Algorithm of the Shortest Path Search Problem in GIS Field

被引：0

作者：

Na, Zhao ^{[1
]}

机构：

[1] Taiyuan Normal Univ, Taiyuan 030012, Peoples R China

来源：

PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON COMMUNICATION, ELECTRONICS AND AUTOMATION ENGINEERING | 2013年 / 181卷

关键词：

GIS; Dijkstra algorithm; shortest path;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Using Dijkstra algorithm for searching shortest path problem is an important content of the application of GIS. Dijkstra algorithm can not find all the shortest paths. The article based on the Dijkstra algorithm, added some data structure and proposed an algorithm that calculate all the shortest path of one vertex to others, the algorithm data structure is relatively simple, while effectiveness of the algorithm is verified by an example.

引用

页码：1035 / 1039

页数：5