摘要
给出了 1个求统筹图中关键路线的多项式算法 ,证明了该算法的理论依据 ,分析了它的复杂性为O(n3) .
An algorithm is presented for seeking the critical paths in the overall planning graph, which has polynomial complexity O(n 3). The theory, which the algorithm depends on, is verified in detail.
出处
《四川大学学报（自然科学版）》
CAS
CSCD
北大核心
2000年第5期683-687,共5页
Journal of Sichuan University(Natural Science Edition)
关键词
有向图
统筹图
统筹网络
关键路线
算法
the directed graph
overall planning graph
the overall planning network
the critical path
