The Shortest Path Search Based on An Improved Dijkstra Algorithm

摘要：

　　Dijkstra is a classic algorithm to compute the shortest-path in GIS network analysis system.This paper presents a method for shortest path computation process using Dijkstra algorithm based on Pairing heap.Algorithm testing data before and after improvement were analyzed and compared.The results show that the actual average running time of Pairing heap is only less than 26% of the average running time of Fibonacci heap algorithm.

关键词： The Shortest Path Dijkstra Gis Paring Heap

作者: Wei ZHANG Chong JING Yunxiang MA

作者单位: Beijing Institute of Petrochemical Technology,College of information Engineering,Beijing,China,102617

会议类型: 国内会议

会议名称: 第四届信息电子与计算机工程国际会议(The 4th International Conference on Information ,Electronic and Computer Science)

会议地点: 泰安

会议语种:英文

页码: 61-64

在线出版日期: 2012-11-24（万方平台首次上网日期，不代表论文的发表时间）