| 释义 |
critical path algorithm A forward scan determines the earliest time for each vertex in an activity network, and a backward scan determines the latest time for each vertex. The critical path is any path on which the latest time=the earliest time at every vertex, i.e. on which any delays would mean the delay of the completion of the project.
|