摘要
通过研究,在不改变时间复杂度的情况下,依然能对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.
作者
邱晓鹏
王丽君
QIU Xiaopeng;WANG Lijun(Department of Mathematics,Longnan Teachers'College,Chengxian 742500,China;College of Electronic Commerce,Longnan Teachers'College,Chengxian 742500,China)
出处
《太原师范学院学报（自然科学版）》
2019年第2期53-56,67,共5页
Journal of Taiyuan Normal University:Natural Science Edition
作者简介
邱晓鹏(1977-),男,甘肃礼县人,讲师,主要从事数学、图论研究.
