基于改进的Floyd算法求节点间所有最短路径

Finding Shortest Paths between Nodes Based on Improved Floyd Algorithm

网络节点间的最短路径可能不止一条。首先运用加速的Floyd算法得到最短路径长度矩阵;然后根据最短路径长度矩阵构造各个节点的到达距离矩阵,用来与最短路径长度矩阵进行对比;最后得到每个节点的后继节点,进而得到所有最短路径。计算机仿真验证了该算法的高效性。

There may be more than one shortest paths between nodes in the networks.First,the array composed by shortest paths of nodes using the accelerated Floyd algorithm is obtained;then the array composed by arrived distance of each node is constructed using this array,to compared with the array composed by shortest paths;last,followed nodes of each node are obtained,and then all the shortest paths are received.The simulation on the computer shows efficiency of the algorithm.