C Language Realization of the Floyd-Warshall Algorithm
Guo Zhi-jun · Journal of Anqing Teachers College · 2008
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.