摘要
对于给出的事件结点网络,求出从起点到终点的所有路径,经分析、比较后找出长度最大的路径,得出求关键路径的算法,并给出C语言源程序。
Give the event node network and evaluate all the path from start point to the end. After analysis and contrast to find the longest path, which would obtain the algorithm to find the key path. And the original program of C language is shown here.
出处
《机械管理开发》
2006年第5期77-79,共3页
Mechanical Management and Development
关键词
活动
事件
AOEN
关键路径
最少时间
Activity Event Activity On Edge（AOE）Network Key path Least time
