论文信息 - An Improved Dijkstra Algorithm Based on Pairing Heap

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.

Wei Zhang | Chong Jiang | Yunxiang Ma

[1] Robert E. Tarjan,et al. The pairing heap: A new form of self-adjusting heap , 2005, Algorithmica.

[2] John T. Stasko,et al. Pairing heaps: experiments and analysis , 1987, CACM.

[3] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.