Step 1: Draw the AON Diagram
Node A first.
B and C both depend on A.
D depends on both B and C.
E depends on D.
F depends on E.
👉 So the diagram flows:
A → (B, C) → D → E → F
Step 2: Compute Project Duration (Critical Path Method – CPM)
Path 1: A → B → D → E → F = 3 + 4 + 6 + 3 + 2 = 18 days
Path 2: A → C → D → E → F = 3 + 5 + 6 + 3 + 2 = 19 days
👉 The critical path is A → C → D → E → F with 19 days.
a predecessor is an activity that must be completed (or started) before another activity can
begin or finish.
Great question 👍 Let’s break it down clearly.
Critical Path (CPM in Project Management)
Definition:
The critical path is the longest sequence of activities in a project schedule that must be
completed on time for the entire project to finish on schedule.
Key Points:
o It determines the minimum project duration.
o Activities on the critical path have zero float/slack (no extra time).
o If any activity on the critical path is delayed, the whole project is delayed.
o Critical path can change during the project if delays or adjustments happen.
✅ Simple Example
Let’s say you’re making coffee (from our earlier example):
Path 1: Boil water (5) → Pour water (1) → Add sugar & milk (2) → Stir & serve (1) = 9
minutes
Path 2: Prepare cup (2) → Add coffee powder (1) → Pour water (1) → Add sugar & milk
(2) → Stir & serve (1) = 7 minutes
👉 The critical path is Path 1 = 9 minutes.
This means the minimum time to make the coffee is 9 minutes—if the boiling water step
delays, the whole coffee-making process delays.
✅ In short:
The critical path shows the longest duration path through a project, controls the project
completion time, and contains the activities you must watch most carefully.
Would you like me to also make a visual diagram highlighting the critical path (like marking it in
red) on either the cake or coffee AON examples?