An ImprovedDijkstra Algorithm Based on Pairing Heap

摘要：

In this paper, we presented a method for shortest path computation process using Dijkstra algorithm based on Pairing heap. We compared the methods by the Pairing heap method and Fibonacci heap method. With experiment, we could see that the method by Pairing heap have more efficiency than by Fibonacci heap.

关键词： shortest path algorithm Dykstra algorithm GIS Network Analysis

作者: Wei Zhang Chong Jiang Yunxiang Ma

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

会议类型: 国际会议

会议名称: 2012 Fifth International Symposium on Computational Intelligence and Design 第五届计算智能与设计国际会议 ISCID 2012

会议地点: 杭州

会议语种:英文

页码: 997-1000

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