Introduction - If you have any usage issues, please Google them yourself
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