Critical Path & Float Calculator
This critical path calculator validates an activity network and calculates early start, early finish, late start, late finish, total float and free float. It models finish-to-start dependencies with zero lag, identifies multiple critical paths and uses a single consistent time unit chosen by the user.
By Dr. Hassan Khames EliwaLast updated
Result
- Critical pathsAll critical paths shown.
- A → B → D
Finish-start, zero-lag activity schedule
| ID | Duration | ES | EF | LS | LF | Total float | Free float |
|---|---|---|---|---|---|---|---|
| A | 3.00 | 0.00 | 3.00 | 0.00 | 3.00 | 0.00 | 0.00 |
| B | 4.00 | 3.00 | 7.00 | 3.00 | 7.00 | 0.00 | 0.00 |
| C | 2.00 | 3.00 | 5.00 | 5.00 | 7.00 | 2.00 | 2.00 |
| D | 1.00 | 7.00 | 8.00 | 7.00 | 8.00 | 0.00 | 0.00 |
How it works
Enter an explicit dependency network
Each textarea row has exactly three comma-separated fields: ID,duration,predecessors. For example, B,4,A means activity B lasts four time units and follows A. Use a dash or an empty third field for no predecessors. List multiple predecessors with spaces or vertical bars, not additional commas. IDs begin with a letter and may contain letters, numbers, underscores and hyphens. There is no header row. Input order does not have to be chronological.
Validate before doing schedule arithmetic
Check for duplicate IDs, unknown predecessors, self-dependencies, repeated predecessors and negative or nonfinite durations. The calculator checks for circular dependencies before scheduling the work. Up to 200 activities are accepted. Disconnected components are permitted: they share a project start at time zero and a common project finish equal to the latest terminal finish. Zero-duration activities can represent milestones. Every dependency is finish-start with no lag; calendars and resource limits are absent.
Forward and backward passes
Early start is the greatest early finish among predecessors, or zero for a starting activity. Early finish adds duration. Working backward from the project finish, late finish is the smallest successor late start, and late start subtracts duration. Total float is late start minus early start. Free float is the earliest successor early start minus the activity’s early finish; terminal activities use the common project finish. Critical paths follow zero-total-float activities connected without timing gaps. Display uses two decimals, but calculations retain numeric precision.
Worked example
Scenario 1: one controlling branch
Enter A,3,- followed by B,4,A; C,2,A; and D,1,B C, each on its own line. A runs from 0 to 3. B runs from 3 to 7, while C runs from 3 to 5. D waits for both and runs from 7 to 8. Project duration is 8.00 time units and the critical path is A → B → D. C has ES 3.00, EF 5.00, LS 5.00, LF 7.00, total float 2.00 and free float 2.00.
Scenario 2: equal parallel branches
Change A to duration 2, B and C to duration 3 each, and retain D at duration 1 with both predecessors. Project duration becomes 6.00 time units. Both A → B → D and A → C → D are critical. C now has ES 2.00, EF 5.00, LS 2.00, LF 5.00 and zero total and free float. Shortening only B would not shorten the project because C still controls D.
From the field
From Dr. Hassan Khames Eliwa's project controls experience
This one I've watched happen more than once: a branch everyone called "non-critical" quietly becomes the thing holding up handover. I've stripped it down to a small plant-room network and rounded the durations so the logic is easy to trace. Working days throughout. Enter these rows, one per line: A,3,-; B,7,A; C,1,A; E,3,C; D,1,B E. A is preparation, B fabrication, C approval, E installation, D the final check. We carried approval as its own activity because the tool doesn't do lags, and frankly it makes the waiting visible.
At the start, finish is 11.00 days on A → B → D. The approval-and-installation chain has 3.00 days total float: C runs from day 3.00 to 4.00, E from 4.00 to 7.00, while B finishes at 10.00. Remember that float belongs to the whole chain, not to each activity separately.
Then the approval took 5 days instead of one. Change only C's duration to 5. C finishes at 8.00, E runs 8.00 to 11.00, and D finishes at 12.00. The critical path flips to A → C → E → D, and B now has 1.00 day total float. Four days of overrun: three swallowed by float, one day of delay to completion.
So I chase approvals while there is still float to protect. Last month's non-critical branch can own next month's handover.
Field quick reference
| Approval case | Project finish, days | Critical path |
|---|---|---|
| Original approval | 11.00 | A → B → D |
| Extended approval | 12.00 | A → C → E → D |
Expert tips
Common mistakes
- Adding a waiting period to every successor can count the same delay repeatedly. Represent the wait as an explicit activity and name the release or approval it represents.
- Criticality describes control of the calculated finish, not cost, safety or commercial importance. A noncritical activity may still deserve close management for reasons outside this network.
- Precedence alone cannot resolve crew clashes. Parallel activities may both need the same unavailable crew, so check the resource plan before accepting their early dates.
Frequently asked questions
Does it show every critical path?
It enumerates up to 100 critical paths and explicitly warns if more exist. Large branching networks can have many paths even when the activity count is modest.
What is the difference between total and free float?
Total float measures delay relative to the common project finish. Free float measures delay before the next activity’s early start is affected, so the two values need not be equal.
Can activities have zero duration?
Yes. Milestones are accepted, provided the dependency graph remains acyclic. Zero-duration activities can also appear on critical paths when their timing connections control completion.
Are leads, lags or other dependency types supported?
No. Only finish-to-start relationships with zero lag are represented. A schedule requiring start-start, finish-finish, constraints or calendars needs a more complete scheduling model.
Why was my network rejected as cyclic?
A chain eventually depends on itself, directly or indirectly. No valid forward order exists in that case. Review predecessor IDs and remove the mistaken relationship rather than forcing a result.
Related calculators
Related guides
Construction & ProjectMonte Carlo schedule risk in plain English: what P50 and P80 actually meanRead schedule percentiles without confusing a serial simulation, a network forecast and a commitment.15 November 2026 · 8 min read
Construction & ProjectCritical path and float: a ten-activity exampleWork through a ten-activity network, calculate early and late dates, and distinguish total float from free float.14 November 2026 · 8 min read
Construction & ProjectThree-point estimating: when PERT beats a single guessA practical guide to three-point duration estimates, weighted averages and the limits of turning uncertain activities into a promised date.14 November 2026 · 7 min read
Construction & ProjectEarned value management in plain English: CPI, SPI and what to do about themTurn planned value, earned value and actual cost into useful decisions without confusing budget performance with cash flow or time.14 November 2026 · 7 min readSources and standards
About the author
Dr. Hassan Khames Eliwa holds a PhD in Construction & Built Environment and has more than 20 years of international project controls experience. He is Director of Eliwa Project Controls Limited in Auckland and founder of PMMilestone.org and PMMilestone.com.
Buy me a coffee