基于Floyd算法的最短路径优化研究

Research on Shortest Path Optimization Based on Floyd Algorithm

通过研究,在不改变时间复杂度的情况下,依然能对Floyd算法进行优化改进,提高运算速度,降低空间复杂度.并提出相应的Floyd改进优化算法.此改进算法不仅能够大大减少计算量,甚至在相同复杂路径下,能够减少10%~20%的运算时间.

Through research,the Floyd algorithm can still be optimized and improved without changing the time complexity,which can improve the calculation speed and reduce the space complexity.The corresponding Floyd improved optimization algorithm is proposed.This improved algorithm can not only greatly reduce the amount of calculation,but also reduce the computation time by 10%to 20%even in the same complex path.