关键路径算法，采用邻接表结构存储图。计算最早发生时间和最晚发生时间，最终算得关键路径-Critical path algorithm, using the adjacency list structure is stored map. The calculation of the earliest and latest time of occurrence, and ultimately be regarded as the critical path