| 一个求解次短和渐次短路径的实用算法 |
| |
| 引用本文： | 陈文兰,潘荫荣.一个求解次短和渐次短路径的实用算法[J].计算机应用与软件,2006,23(1):94-96. |
| |
| 作者姓名： | 陈文兰 潘荫荣 |
| |
| 作者单位： | 1. 滁州学院数学与计算机科学系,安徽,滁州,239000
2. 华东师范大学计算机科学与技术系,上海,200062 |
| |
| 摘 要： | 求解第k短路径问题在决策支持系统和咨询系统中具有广泛的用途，本文基于Dijkstra算法，给出了一个求解次短路径和渐次短路径的算法，并且分析了算法的时间复杂度和空间复杂度。
|
| 关 键 词： | 最短路径 第k短路径 次短路径 渐次短路径 时间复杂度 空间复杂度 |
| 收稿时间： | 12 30 2004 12:00AM |
| 修稿时间： | 2004-12-30 |
A PRACTICAL ALGORITHM FOR THE SECOND AND THIRD SHORTEST-PATH PROBLEM |
| |
| Chen Wenlan,Pan Yinrong.A PRACTICAL ALGORITHM FOR THE SECOND AND THIRD SHORTEST-PATH PROBLEM[J].Computer Applications and Software,2006,23(1):94-96. |
| |
| Authors: | Chen Wenlan Pan Yinrong |
| |
| Affiliation: | 1 Dept. of Mathematics and Computer Science, Chuzhou University, Chuzhou Anhui 239000, China; 2 Dept. of Computer Science and Technology, East China Normal University, Shanghai 200062, China |
| |
| Abstract: | 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 second and third shortest-path problem.The time complexity and space complexity of the algorithm also have been discussed. |
| |
| Keywords: | Shortest path The k shortest path The second shortest path The third shortest path Time complexity Space complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
