介绍求关键路经的算法，对于给出的事件结点网络，要求求出从起点到终点的所有路径，经分析、比较后找出长读最大的路径，从而得出求关键路径的算法，并给出计算机上机实现的源程序。 -Introduced via the key for the algorithm, given the events of the node network, the requirements derived from the starting point for all the path to the end of analysis, comparison, after a long time to find the path of the greatest, so as to arrive at the critical path for the algorithm, and gives the computer realization of the source machine.