Critical path

Critical path — критический путь.

An important parameter in any PERT digraph is the length of the longest path from the start to the termination vertex. Such a path is called a critical path, and its length represents the shortest time within which the overall task can be completed. For this reason the analysis is sometimes called CPM (Critical path method).

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.