h阶关键路算法

ｈ阶关键路算法秦裕瑗（武汉钢铁学院４３００８１）ＡｎＡｌｇｏｒｉｔｈｍｆｏｒＦｉｎｄｉｎｇＣｒｉｔｉｃａｌＰａｔｈｏｆｔｈｅｋ－ｔｈＯｒｄｅｒＱｉｎＹｕｙｕａｎ（ＷｕｈａｎＩｒｏｎａｎｄＳｔｅｅｌＵｎｉｖｅｒｓｉｔｙ４３００８１）ＡｂｓｔｒａｃｔＢａ...

An Algorithm for Finding Critical Path of the k-th Order

Based on the principle of optimality of the k-th order, given by Wu 4], the article dis-cusses the train of thought, method and results of finding the critical-(longest)-path-of -k-th -order problem in networks through an illustrative example. It gives an algorithm which can also be implemented in a tableau form or even in the network graphically. The algorithm works whichever k is. The computational complexity is O(k² log k n². The algorithm seems better than that given in 3], no matter how it be form the standing point of the train of thought, the formulation and the presentation.