Introduction - If you have any usage issues, please Google them yourself
Problem description: Design a program to complete the whole project at least find the time required and the whole project is a key activity.
Basic requirements:
(1) a description of the project AOE network, should determine whether it can proceed smoothly.
(2) If the project can proceed smoothly, the output to complete the whole project at least the number of times, and each of the key activities of the two vertices of attachment, the earliest time, the latest time of occurrence.