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.