| 网络中一边长度改变的最短路算法 |
| |
| 引用本文： | 尹良龙,顾保南.网络中一边长度改变的最短路算法[J].系统工程理论与实践,1995,15(3):26-31. |
| |
| 作者姓名： | 尹良龙 顾保南 |
| |
| 作者单位： | 同济大学道路与交通工程系 |
| |
| 摘 要： | 本文提出了网络中一边长度改变的最短路算法，适合于大型网络中一边或几条边长度改变后各点对之间最短路的校正计算。
|
| 关 键 词： | 最短路径 网络 算法 运输规划 |
| 收稿时间： | 1993-05-08 |
An Algorithm to Finding the Shortest Path in a Changes Network |
| |
| Yin Lianglong Gu Baonan.An Algorithm to Finding the Shortest Path in a Changes Network[J].Systems Engineering —Theory & Practice,1995,15(3):26-31. |
| |
| Authors: | Yin Lianglong Gu Baonan |
| |
| Institution: | Tongji University,Shanghai 200092 |
| |
| Abstract: | In this paper,a new algorithm is presented to determine the shortest paths in a network in which some link or some links are changed.The algorithm takes less CPU time and internal memory than the other algorithms existed, so mag be used in transportation planning of large scale networks. |
| |
| Keywords: | shortest path network algorithm transportation planning |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
