| 变形FLOYD算法 |
| |
| 引用本文： | 程国忠.变形FLOYD算法[J].西华师范大学学报(哲学社会科学版),1998,19(3):318-321. |
| |
| 作者姓名： | 程国忠 |
| |
| 作者单位： | 四川师范学院数学系 |
| |
| 摘 要： | 给出了求有向网络中每对顶点间最短路径的变形Ｆｌｏｙｄ算法，其时间复杂度与Ｆｌｏｙｄ算法同量级，形象直观且易编写程序。
|
| 关 键 词： | Floyd算法 数据结构 有向网络 最短路径 |
DEFORMED FLOYD ALGORITHM |
| |
| Cheng Guozhong.DEFORMED FLOYD ALGORITHM[J].Journal of China West Normal University:Natural Science Edition,1998,19(3):318-321. |
| |
| Authors: | Cheng Guozhong |
| |
| Abstract: | The deformed Floyd algorithm of the shortest path between the two nodes in the directed networks is presented and the complexity of time shares the same rank with Floyd algorithm,but it reveals an object image and provides an easy way to programme. |
| |
| Keywords: | Floyd algorithm data structure directed networks shortest path |
| 本文献已被 CNKI 维普 等数据库收录！ |
