Draw activities as boxes and links as arrows and you get a network diagram (the precedence diagram). Every route from the first activity to the last is a path, and a path's length is the sum of its durations, plus any lags on its links.
The longest path sets the shortest time the project can take: nothing can finish before the slowest chain of work does. That path is the critical path, and its length is the project duration.
To find it by hand:
- List every path from start to finish. A merge (an activity with two predecessors) is where paths join; a burst (an activity with two successors) is where they split.
- Add up each path.
- The longest is critical. If two paths tie, both are critical.
Short paths have room to slip. The next lessons work out exactly how much, without listing every path.
Two paths through a small network; the longest sets the project duration.