Free Critical Path Calculator
Find Your Longest Path
I used the critical path method on every major project I managed in the UAE, including EGA Head Office and The Constellation. Enter your project tasks, durations and dependencies and get instant forward pass, backward pass, Early Start, Early Finish, Late Start, Late Finish dates, total float, free float and critical path identification. No signup, no download.
Critical Path Calculator
Enter tasks below, then click Calculate to find your critical path
(days)
Tasks
Float
| Task | Duration | ES | EF | LS | LF | Total Float | Free Float | Critical? |
|---|
How to Calculate the Critical Path
Step 1: Add your tasks. Click "+ Add Task" for each activity in your project. Give each task a name and its duration in days, or any consistent unit such as hours or weeks, as long as you stay consistent.
Step 2: Set dependencies. In the Predecessors column, enter the ID numbers shown in the blue badge for any tasks that must finish before this task can start. Use commas to separate multiple predecessors. For example, "1,3" means both Task 1 and Task 3 must finish before this task starts. Leave the field blank for tasks with no predecessors, which are your start tasks.
Step 3: Click Calculate. The calculator performs the forward pass, calculating ES and EF for every task, and the backward pass, calculating LS and LF. Then it identifies all tasks with Total Float of zero as your critical path.
Critical Path Method: All Formulas
The Critical Path Method uses two passes through the network to calculate all scheduling values. I used these exact formulas on every schedule I built in the UAE, sometimes by hand before software made it easy.
Critical Path Identification
A task is on the critical path when Total Float equals zero. The critical path is the continuous chain of zero-float tasks from the project's first task to the last. It represents the longest path through the network and determines the minimum project duration.
There can be multiple critical paths if two or more paths through the network are equally long. In that case, all tasks on all equally long paths have zero float and are critical.