How it works
Validate an acyclic dependency graph. Forward pass finds earliest starts/finishes; backward pass finds latest times and slack. Zero-slack tasks are critical within a small numeric tolerance.
Input definitions
- CSV: task,duration,dependencies separated by semicolons
- Plain text; maximum 200,000 characters.
A worked example
- CSV: task,duration,dependencies separated by semicolons
- task,duration,dependencies A,2, B,3,A C,1,A D,2,B;C
Assumptions & limits
At most 200 tasks, zero-duration milestones allowed. All durations use one consistent unit.
Sources & review
Maintained by AnsRio. Methods and examples use automated checks; this does not imply independent professional certification.
Method updated 2026-10-17. Content checked against the stated method and examples. Our verification approach.
Common questions
Does the critical path account for limited staff or equipment?
No. Dependencies and deterministic durations are modeled, but resource leveling, working calendars, task lags and uncertainty are excluded.
How does Project critical path and slack work?
Validate an acyclic dependency graph. Forward pass finds earliest starts/finishes; backward pass finds latest times and slack. Zero-slack tasks are critical within a small numeric tolerance.
What are the limits of Project critical path and slack?
At most 200 tasks, zero-duration milestones allowed. All durations use one consistent unit.
How do I keep the full worksheet?
Run the tool and choose Download file. The on-page table is a preview and may show only the first 20 rows; the downloaded file contains the full result. CSV downloads escape spreadsheet formula prefixes. Inputs and files are processed on your device.