| 交通网络最短路权矩阵的迭代算法 |
| |
| 引用本文： | 任刚,王炜. 交通网络最短路权矩阵的迭代算法[J]. 交通与计算机, 2005, 23(5): 8-12 |
| |
| 作者姓名： | 任刚 王炜 |
| |
| 作者单位： | 东南大学,南京,210096 |
| |
| 基金项目： | 东南大学博士科研启动项目（9221002224） |
| |
| 摘 要： | 介绍了求解交通网络最短路权矩阵的3种迭代算法,从迭代思路、时间复杂度、程序可读性等方面进行了比较,指出各算法的异同点以及联系,最后通过一个具体网络模拟了各算法的迭代过程.
|
| 关 键 词： | 交通网络 时间复杂度 最短路径 最短路权矩阵 迭代算法 |
| 收稿时间： | 2005-03-15 |
| 修稿时间： | 2005-03-15 |
Iterative algorithms for the Shortest Path Weight Matrix over Traffic Networks |
| |
| REN Gang,WANG Wei. Iterative algorithms for the Shortest Path Weight Matrix over Traffic Networks[J]. Computer and Communications, 2005, 23(5): 8-12 |
| |
| Authors: | REN Gang WANG Wei |
| |
| Abstract: | Three iterative algorithms for finding the shortest path weight matrix over traffic networks are introduced. These algorithms are compared with each other in many aspects, including iterative principle, time complexity and readability of program, etc. The similarities, differences and relationship among the algorithms are pointed out.Finally,the iterative process of these algorithms are simulated in an example. |
| |
| Keywords: | traffic network time complexity shortest path shortest weight mat rix iterative algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
