To Figure Out the First Rth Shortest Path Based on Optimal Floyed Algorithm
Wenning Wang · Journal of Changzhou Institute of Technology · 2009
The shortest path algorithm is applied in many fields.The normal Floyed shortest path algorithm is supposed to deal with the shortest path between every two dots.Based on the analyzing of Floyed shortest path algorithm,the article presents the optimal algorithm of Floyed shortest path algorithm that can give the first Rth shortest path between every two dots.And also,the article demonstrates some improvement,which can be used to make the algorithm quicker,particularly when it deals with the sparse graph.