摘要
最短路径分析在地理信息系统、计算机网络路由等方面发挥了重要的作用,对其进行优化很有必要。本文分析了传统的最短路径算法(即Dijkstra算法)的优化途径及现有的优化算法,然后在Dijkstra算法的基础上,采用配对堆结构来实现路径计算过程中优先级队列的一系列操作,经理论分析与实验测试结果对比,可以大大提高该算法的效率和性能。
The shortest path analysis in aspect and so on geographic information system, computer network route has played the vital role, carries on the optimization to it to have the necessity very much, This paper analyses the optimal way and the now available optimization algorithm the traditional shortest path algorithm （i.e. Dijkstra algorithm）, and achieves a series of operational priority queue in path computation process using Paired heap based on Dijkstra algorithm, by that theoretical analysis and the experiment test result contrast , efficiency and function being able to improve that algorithm greatly.
出处
《微计算机信息》
北大核心
2007年第33期275-277,共3页
Control & Automation
基金
湖南省自然科学基金(06JJ513)
湖南省教育厅科研项目(06C441)
