A mathematical algorithm for computing the shortest duration of a set of project activities given a set of precedence-successor relationships between the activities. The sequence of activities that comprises the shortest duration is called the “critical path”.