数据结构中关键路径算法的实现与应用。介绍求关键路经的算法，对于给出的事件结点网络，要求求出从起点到终点的所有路径，经分析、比较后找出长读最大的路径，从而得出求关键路径的算法。-data structure Critical Path algorithm implementation and application. Introduced for passing key algorithm is given for the incident node network requirements derived from the start-to-end path of all, the analysis and comparison to identify a long time after the path, thereby reaching critical path for the algorithm.