摘要
针对不含负回路网络中最短路Ford算法运算量大、直观性差的不足,引入表上作业法思想,从提高算法效率和增强计算直观性2个方面对其进行改进,并给出新的算法。新算法既能快速计算最短路权又能更直观地表现解题过程,是一种计算最短路的简捷方法。仿真结果和算例表明了新算法的有效性。
To avoid the disadvantage of computation complexity and observation in the process of finding the shortestpaths problem without minus loop by the Ford method,the idea of table- manipulation method is introduced and a new algorithm is presented,which is obtained by improving the efficiency of Ford method and enhancing observation for calculation. Since it can both calculate shortest- path weights more quickly and exhibit the process more directly,the new algorithm is a simple and direct method for calculating shortest paths with the simulation results and example proved the effectiveness of the new algorithm.
出处
《现代电子技术》
2007年第20期111-113,117,共4页
Modern Electronics Technique
关键词
网络
最短路
表上作业法
算法
network
shortest path
table - manipulation method
algorithm
