An Improved Dijkstra 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 Dijkstra algorithm CIS Network Analysis

作者: Zhang Wei Zhang Ke Suh Heejong

作者单位: Beijing Institute of Petrochemical Technology College of information Engineering Beijing,China, 1026 Chonnam National University Department of Electronic Communication Engineering Yeosu-si,Jeollanam-do

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

会议地点: 太原

会议语种:英文

页码: 220-223

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