[1]王贺明.对R. W. Floyd算法的一点扩展[J].郑州大学学报(工学版),1993,14(03):64-68.
Wang Heming,A little expansion of the R. W. FLOYD algorithm[J].Journal of Zhengzhou University (Engineering Science),1993,14(03):64-68.
点击复制
对R. W. Floyd算法的一点扩展(
)
《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]
- 卷:
-
14卷
- 期数:
-
1993年03期
- 页码:
-
64-68
- 栏目:
-
- 出版日期:
-
1993-09-28
文章信息/Info
- Title:
-
A little expansion of the R. W. FLOYD algorithm
- 作者:
-
王贺明;
-
郑州工学院水利系,
- Author(s):
-
Wang Heming;
-
The Department of Water Conservancy, Zhengzhou Institute of Technology,
-
- 关键词:
-
本文对Floyd算法进行了分析; 在此基础上提出了一种扩展的Floyd算法。该算法在实际工程中有一定的应用价值。扩展的Floyd算法已在计算机上实现; 计算结果证明该算法正确。
- Keywords:
-
Algorithm; the shortest path; road selection
- 文献标志码:
-
A
- 摘要:
-
算法;;最短路径;;路选表
- Abstract:
-
This article analyzes the FLOYD algorithm, and on this basis, a expansion FLOYD algorithm is proposed. The algorithm has a certain application value in actual engineering. The extended FLOYD algorithm has been implemented on the computer, and the calculation results prove that the algorithm is correct.
更新日期/Last Update:
1900-01-01