| Floyd-Warshall算法的C语言实现 |
| |
| 引用本文： | 郭志军.Floyd-Warshall算法的C语言实现[J].安庆师范学院学报(自然科学版),2008,14(4). |
| |
| 作者姓名： | 郭志军 |
| |
| 作者单位： | 辽宁对外经贸学院信息技术系,辽宁大连,116052 |
| |
| 摘 要： | Floyd-Warshall算法是一种找出赋权图中各结点之间的最短距离的高效算法,该算法不仅适用权值大于等于零的一般问题,也可用于权值小于零的问题。通过对算法的研究,给出Floyd-Warshall算法的一个C语言程序。
|
| 关 键 词： | 赋权图 Floyd-Warshall算法 C语言程序 |
C Language Realization of the Floyd-Warshall Algorithm |
| |
| GUO Zhi-jun.C Language Realization of the Floyd-Warshall Algorithm[J].Journal of Anqing Teachers College(Natural Science Edition),2008,14(4). |
| |
| Authors: | GUO Zhi-jun |
| |
| Institution: | GUO Zhi-jun(Liaoning University of Intemational Business , Eonomics,Liaoning 116052,China) |
| |
| Abstract: | The Floyd-Warshall algorithm,which is not only suitable the general question that the weight to bigger than or equal to zero but also the question that weight being smaller than zero,is a highly effective algorithm that the shortest distance between every nodes in weighted graph can be found out.Through the research about the algorithm,one can give a c language procedure of Floyd-Warshall algorithm,and apply this procedure to solve practical problems. |
| |
| Keywords: | weighted graph Floyd-Warshall algorithm c language procedure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
