Financial-Adjacent

Critical Path and Float Calculator (CPM)

Link up to six activities by what must finish first, and get the programme's length, its critical path and the float every other activity has.

  • Answers as you type
  • Every formula cited
  • Calculated in your browser
SettingsSettings for this calculationUS
Market
Imperial · sales tax
How long activity A takes, in working days.

The activity's own duration, from the quantity and the crew. Zero leaves it out of the network, along with any link to it.

How long activity B takes, in working days.

The activity's own duration, from the quantity and the crew. Zero leaves it out of the network, along with any link to it.

An activity that must finish before B can start.

Only earlier activities are offered, so the network can never loop back on itself. Leave it at None if the activity can start as soon as the job does.

An activity that must finish before B can start.

Only earlier activities are offered, so the network can never loop back on itself. Leave it at None if the activity can start as soon as the job does.

How long activity C takes, in working days.

The activity's own duration, from the quantity and the crew. Zero leaves it out of the network, along with any link to it.

An activity that must finish before C can start.

Only earlier activities are offered, so the network can never loop back on itself. Leave it at None if the activity can start as soon as the job does.

An activity that must finish before C can start.

Only earlier activities are offered, so the network can never loop back on itself. Leave it at None if the activity can start as soon as the job does.

How long activity D takes, in working days.

The activity's own duration, from the quantity and the crew. Zero leaves it out of the network, along with any link to it.

An activity that must finish before D can start.

Only earlier activities are offered, so the network can never loop back on itself. Leave it at None if the activity can start as soon as the job does.

An activity that must finish before D can start.

Only earlier activities are offered, so the network can never loop back on itself. Leave it at None if the activity can start as soon as the job does.

How long activity E takes, in working days.

The activity's own duration, from the quantity and the crew. Zero leaves it out of the network, along with any link to it.

An activity that must finish before E can start.

Only earlier activities are offered, so the network can never loop back on itself. Leave it at None if the activity can start as soon as the job does.

An activity that must finish before E can start.

Only earlier activities are offered, so the network can never loop back on itself. Leave it at None if the activity can start as soon as the job does.

How long activity F takes, in working days.

The activity's own duration, from the quantity and the crew. Zero leaves it out of the network, along with any link to it.

An activity that must finish before F can start.

Only earlier activities are offered, so the network can never loop back on itself. Leave it at None if the activity can start as soon as the job does.

An activity that must finish before F can start.

Only earlier activities are offered, so the network can never loop back on itself. Leave it at None if the activity can start as soon as the job does.

Length of the programme

17 days

High confidence

The programme takes 17 working days. The critical activities — zero float, where a day lost is a day on the end — are A, B, D, E, F. The nearest to becoming critical is C, with 1 day of float. Float belongs to the path, not to one activity: using it up on one activity takes it from the others on the same path.

Activity A: total float (early start day 0, late start day 0)
0 days
Activity B: total float (early start day 5, late start day 5)
0 days
Activity C: total float (early start day 5, late start day 6)
1 day
Activity D: total float (early start day 8, late start day 8)
0 days
Activity E: total float (early start day 12, late start day 12)
0 days
Activity F: total float (early start day 14, late start day 14)
0 days
Then change the inputs to see how far the answer moves.

Show calculation logic

How this was calculated

Formula source(s)

  • The critical path method, Kelley and Walker (1959): a forward pass sets each activity's early start as the latest early finish of the activities it follows, a backward pass sets its late finish as the earliest late start of the activities that follow it, and total float is late start minus early start
  • Critical activities are those with zero total float; any delay to one of them delays the end of the programme by the same amount, while an activity with float can slip by up to its float without moving the end

Inputs used

Activity A Duration (days, 0 to leave out)
5
Activity B Duration (days, 0 to leave out)
3
Activity B: First Activity It Follows
Activity A
Activity B: Second Activity It Follows
None
Activity C Duration (days, 0 to leave out)
6
Activity C: First Activity It Follows
Activity A
Activity C: Second Activity It Follows
None
Activity D Duration (days, 0 to leave out)
4
Activity D: First Activity It Follows
Activity B
Activity D: Second Activity It Follows
None
Activity E Duration (days, 0 to leave out)
2
Activity E: First Activity It Follows
Activity C
Activity E: Second Activity It Follows
Activity D
Activity F Duration (days, 0 to leave out)
3
Activity F: First Activity It Follows
Activity E
Activity F: Second Activity It Follows
None

Intermediate steps

Activity A: total float (early start day 0, late start day 0)
0 days
Activity B: total float (early start day 5, late start day 5)
0 days
Activity C: total float (early start day 5, late start day 6)
1 day
Activity D: total float (early start day 8, late start day 8)
0 days
Activity E: total float (early start day 12, late start day 12)
0 days
Activity F: total float (early start day 14, late start day 14)
0 days
Final result17 days

Confidence note: The programme takes 17 working days. The critical activities — zero float, where a day lost is a day on the end — are A, B, D, E, F. The nearest to becoming critical is C, with 1 day of float. Float belongs to the path, not to one activity: using it up on one activity takes it from the others on the same path.

What this calculation does not cover

  • Finish-to-start links only, with no lags: each activity starts when everything it follows has finished. Overlaps, lead-ins and waiting times need a scheduling program.
  • Six activities. Real programmes have hundreds, and this is for checking a small sequence or learning how float is found, not for running a job.
  • Durations are in working days and the result is too. The working-days calculator turns it into calendar days.

Computed in your browser — nothing you enter is uploaded. Presented in US customary units and US trade terminology. Where a formula follows a published standard, that standard and its edition are cited beside it on this page; where none governs, the page says so. Local amendments override model codes — verify against the code in force where you build.

Sources checked 2026-09-22 · v1.0.0

Regulatory standards & verification citations2
  1. The critical path method, Kelley and Walker (1959): a forward pass sets each activity's early start as the latest early finish of the activities it follows, a backward pass sets its late finish as the earliest late start of the activities that follow it, and total float is late start minus early start
  2. Critical activities are those with zero total float; any delay to one of them delays the end of the programme by the same amount, while an activity with float can slip by up to its float without moving the end
Cite this page

Your workspace

Most jobs need more than one number. Add the calculators you need next and they open right here, underneath this one — your figures stay on screen and nothing is lost to a page change.

How to calculate critical path and float (CPM) in 17 steps

  1. Activity A Duration (days, 0 to leave out)How long activity A takes, in working days.
  2. Activity B Duration (days, 0 to leave out)How long activity B takes, in working days.
  3. Activity B: First Activity It FollowsAn activity that must finish before B can start.
  4. Activity B: Second Activity It FollowsAn activity that must finish before B can start.
  5. Activity C Duration (days, 0 to leave out)How long activity C takes, in working days.
  6. Activity C: First Activity It FollowsAn activity that must finish before C can start.
  7. Activity C: Second Activity It FollowsAn activity that must finish before C can start.
  8. Activity D Duration (days, 0 to leave out)How long activity D takes, in working days.
  9. Activity D: First Activity It FollowsAn activity that must finish before D can start.
  10. Activity D: Second Activity It FollowsAn activity that must finish before D can start.
  11. Activity E Duration (days, 0 to leave out)How long activity E takes, in working days.
  12. Activity E: First Activity It FollowsAn activity that must finish before E can start.
  13. Activity E: Second Activity It FollowsAn activity that must finish before E can start.
  14. Activity F Duration (days, 0 to leave out)How long activity F takes, in working days.
  15. Activity F: First Activity It FollowsAn activity that must finish before F can start.
  16. Activity F: Second Activity It FollowsAn activity that must finish before F can start.
  17. Length of the programmeThe tool computes the length of the programme from those figures and shows the formula, its sources, and a confidence rating alongside it.

Length of the programme by activity A duration (days, 0 to leave out)

Page defaults, not your figures above.

Activity A Duration (days, 0 to leave out)Length of the programme (days)
0.512.5
113
214
517
1022
2032
5062

Frequently asked questions

What is the critical path?
The longest chain of linked activities through the programme. Its length is the programme's length, and every activity on it has zero float: a day lost on any of them is a day added to the end. Activities off it can slip by their float without moving the finish — until they use it up, at which point they join the critical path.
What is total float?
How far an activity can slip without delaying the end of the programme: its late start minus its early start. It belongs to the path rather than the activity, so two activities in a row sharing four days of float have four days between them, not four each.
Why are there only six activities, and no lags?
Because the page is for checking a short sequence and for seeing how float is found, not for running a job. A real programme has hundreds of activities, start-to-start and finish-to-finish links, lags and calendars, and belongs in scheduling software. Six finish-to-start activities are enough to show every idea the method rests on.
Can two activities start at the same time?
Yes. Any activity left following nothing starts on day zero, so several can start together. Each activity can follow up to two earlier ones, which is enough to join two paths back together.
Preliminary estimate, not certified engineering. This tool produces an indicative quantity calculation for planning purposes only — it is not a certified structural analysis, a guaranteed material takeoff, or a substitute for building department approval. Always verify measurements on-site and have a licensed contractor or structural engineer review any load-bearing, code-sensitive, or safety-critical work before purchasing materials or starting construction. Spotted an arithmetic or standards error? Report it to contact@craftquantities.com with your inputs — a confirmed fix gets a permanent check of its own, so the same mistake cannot come back.