摘要
Floyd算法是求解网络中任意两点之间最短路的高效算法,文章给出了在不含负回路的网络中Floyd加速算法及优化方法,并构造了求解最短路径的序号矩阵。算法分析和计算实例表明,优化后的Floyd加速算法迭代速度快,计算量大大减少,路径寻找简单、直观。
Floyd algorithm is the most efficient method to find out the shortest path between any two nodes in the network.This paper illustrates the acceleration and optimization of Floyd algorithm in the network without negative circuit,and establishes serial number matrix to find out the shortest path.The algorithmic analysis and calculation examples show that the amount of calculation reduces greatly after using the accelerated and optimized method of Floyd algorithm and it is simple,intuitive and optimize to find out the path.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第17期41-43,46,共4页
Computer Engineering and Applications
基金
广西2008年自然科学基金资助项目(No.2008AM1002桂科技字[2008]32号)
