A New Shortest-path Algorithm Based on Dijkstra
Runtao Liu · Harbin Ligong Daxue xuebao · 2008
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.