Finding Shortest Paths between Nodes Based on Improved Floyd Algorithm
Yu Zhang · Audio Engineering · 2011
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.