| 对R. W. Floyd算法的一点扩展 |
| |
| 引用本文： | 王贺明.对R. W. Floyd算法的一点扩展[J].郑州大学学报(工学版),1993(3). |
| |
| 作者姓名： | 王贺明 |
| |
| 作者单位： | 郑州工学院水利系 |
| |
| 摘 要： | 本文对Floyd算法进行了分析,在此基础上提出了一种扩展的Floyd算法。该算法在实际工程中有一定的应用价值。扩展的Floyd算法已在计算机上实现,计算结果证明该算法正确。
|
| 关 键 词： | 算法 最短路径 路选表 |
An Extension of R.W.Floyd's Algorithm |
| |
| Wang he ming.An Extension of R.W.Floyd's Algorithm[J].Journal of Zhengzhou University: Eng Sci,1993(3). |
| |
| Authors: | Wang he ming |
| |
| Affiliation: | Zhengzhou Institute of Technologe |
| |
| Abstract: | In this paper, Floyd's algorithm is studied, based on this, extented floyd's algorithm is constructed. Extented algorithm is very useful in practical engineering. Exteinted Floyd's algorithm have finished on the computer, the conputation results show that exteinted algorithm is right. |
| |
| Keywords: | Algorithm shortest-path path node list |
| 本文献已被 CNKI 等数据库收录！ |
