摘要
求解k短路径问题在决策支持系统和咨询系统中具有广泛的用途,文章基于Dijkstra算法,给出了一个求解k短路径实用算法,并且分析了算法的时间复杂度和空间复杂度。
The k shortest-path problem is widely practical in decision support system and consultation system.In this paper,based on the Dijkstra＇s algorithm,we give a algorithm to solve the k shortest -path problem.The time complexity and space complexity of the algorithm also have been discussed.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第36期63-65,共3页
Computer Engineering and Applications
关键词
最短路径
k短路径
时间复杂度
算法
shortest path,the k shortest path,time complexity,algorithm
