论文部分内容阅读
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.