一种基于Dijkstra的最短路径算法

A New Shortest-path Algorithm Based on Dijkstra

介绍了Dijkstra算法,在详细分析了该算法的实现方法以及其缺点的基础上,提出一种基于Dijkstra算法的优化算法-优先队列算法,在搜索最小的节点时,该算法的时间复杂度大大降低,具有较好适用性.

This paper introduces the classical algorithm of Dijkstra, and its limitation. The paper emphasizes an optimization of shortest-paths-the algorithm of priority queue, when searching the smallest nodes. The time complexity of the algorithm is reduced significantly.