摘要
运用Floyd算法对求解PERT问题中任意两点间最短距离路径的方法进行了讨论,指出了2种确定最短路径岛上的弧的方法——试验法和终止法在Floyd算法中的适应领域;在比较了各种算法的时间复杂度的基础上,重点分析了采用F1oyd算法求解该问题的优越性,并介绍了该算法的思想、计算步骤;同时使用Java语言设计演示程序说明了Floyd算法的实现机制;最后还指出了进一步解决该问题的方向。
It presents the shortest path between two points in PERT using Floyd algorithm, points out the experimental method and terminal method which is adapt for in the period of using Floyd. It shows the detail about Floyd algorithm, analyzes its computing routine, compares the time complexity of these relative algorithms. It develops a Java demo program based on Floyd algorithm realization mechanism, describes the further way to solve the problem.
