摘要
给出了求有向网络中每对顶点间最短路径的变形Ｆｌｏｙｄ算法，其时间复杂度与Ｆｌｏｙｄ算法同量级。
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.
出处
《四川师范学院学报（自然科学版）》
1998年第3期318-321,共4页
Journal of Sichuan Teachers College(Natural Science)
