摘要
对不含负回路的网络中所有顶点对之间的最短路问题,通常采用Floyd算法.对此算法进行了讨论,并对Floyd算法的计算过程作了一点改进.改进后的算法对阶数不太大的网络进行较简单的计算就能得出所有顶点对之间的最短路.
Floyd algorithm is usually used in shortest path when a graph does not include negative circuit. This article first discusses this algorithm, and then gives some modification of the calculating process of this algorithm. The modified algorithm can produce the shortest paths between peaks with simple calculation when it comes to networks with not too big number of orders.
出处
《重庆工学院学报（自然科学版）》
2008年第5期156-159,共4页
Journal of Chongqing Institute of Technology
基金
北方民族大学科研项目(2007Y044)
