Optimization and analysis of floyd algorithmic for the shortest path problem
This paper based on the traditional Floyd algorithm,used dynamic programming,it could calculate the final shortest path matrix only by two iterative steps.And if the new node is not shorter than the original,it should not be involved in the calculation,This method could simplify the operation steps of weight matrix calculation and save the matrix operation time.The analysis results show that the algorithm reduces the computational complexity and improves the efficiency of operations.
graph theory algorithmthe shortest path problemFloyd algorithm
NETL
NSTL
万方数据
维普
