摘要
分析了在GIS中Dijkstra算法解决实际最短路径问题时存在的不足,提出了一种改进的Dijkstra算法,运用GIS的路径规划功能,采用二叉堆数据结构来实现优先级队列的优化算法。通过实例验证,改进后的Dijkstra算法较原算法在时间效率上有了明显的提高。
The paper analyzed the shortcomings of solving actual shortest path problems using Dijkstra algorithm in GIS, proposed the improved Dijkstra algorithm that using path planning function of GIS and binary heap data structure to implement optimization algorithm of priority queue. The example showed that the improved Dijkstra algorithm is improved than the original algorithm in time efficiency.
出处
《陕西煤炭》
2013年第2期17-18,7,共3页
Shaanxi Coal
