摘要
求解第 k 短路径问题在决策支持系统和咨询系统中具有广泛的用途,本文基于 Dijkstra 算法,给出了一个求解次短路径和渐次短路径的算法,并且分析了算法的时间复杂度和空间复杂度。
The k shortest-path problem is widely practical in decision support system and consuhation system. In this paper, based on the Dijkstra＇s algorithm ,we give a algorithm to solve the second and third shortest-path problem. The time complexity and space complexity of the algorithm also have been discussed.
出处
《计算机应用与软件》
CSCD
北大核心
2006年第1期94-96,共3页
Computer Applications and Software
关键词
最短路径
第k短路径
次短路径
渐次短路径
时间复杂度
空间复杂度
Shortest path The k shortest path The second shortest path The third shortest path Time complexity Space complexity
作者简介
陈文兰，硕士，主研领域：计算机网络。
