Critical Path Calculator
See which activities determine the earliest modeled finish and which have room to move. Inspect dependency chains, compare a duration change and keep the timing, float and assumptions together in an exportable plan.
See what determines your project finish.
Connect activities, inspect the critical chains, and compare a changed duration without losing the original plan.
Project finish 13 elapsed days. 1 critical chain.
Earliest project finish
13 elapsed days
Measured from time 0, with the entered finish-to-start links and waiting lags. This is the base plan.
- Activities
- 6
- Critical activities
- 5
- Critical chains
- 1
Project assumptions
Every duration and waiting lag uses one consistent unit.
For example: days, hours, or weeks. This label does not convert values or apply weekends, holidays, or work calendars.
Time starts at 0. Activities may run in parallel; the model does not limit shared workers, equipment, or other resources.
Activities (6/60)
A duration of zero represents a milestone.
Activity ID: C
In elapsed days. Use 0 for a milestone; blank values are not treated as zero.
Removing it also removes its 2 incoming or outgoing dependencies.
All activity drafts
- A · Brief
Duration: 2
- B · Design
Duration: 4
- C · Procurement
Duration: 3
- D · Build
Duration: 5
- E · QA
Duration: 2
- F · Release
Duration: 0
Dependencies (6/240)
A successor starts after its predecessor finishes and its waiting lag has elapsed.
In elapsed days. Zero means no additional wait after the predecessor finishes. Negative lags are not supported.
All dependency drafts
- A → B
d1 · waiting lag 0
- A → C
d2 · waiting lag 0
- B → D
d3 · waiting lag 0
- C → D
d4 · waiting lag 0
- D → E
d5 · waiting lag 0
- E → F
d6 · waiting lag 0
Import or save the complete problem
Import replaces the entire project only after all records validate. An invalid import leaves the current project unchanged.
Nine columns: record_type, id, label, from, to, duration, lag, value, enabled. Use the current plan as a complete template, including project/unit and enabled flags.
Input export preserves drafts, including disabled target and scenario values. The explicit encoding record makes quoted text safe to reopen in a spreadsheet and restores it on import.
See what controls the finish
Select an activity to connect its schedule, dependencies, and exact explanation.
Time in elapsed days from project start. * marks critical activities. Diamonds are zero-duration milestones.
- * Critical activity
- ━ Activity duration
- ┄ Total float
- ━ Free float below total float
Very short positive durations use a thin mark when they are smaller than a pixel. Exact values remain in the table. Total float is shared along a chain; using it can move later activities.
Showing 1–6 of 6 activities
C: Procurement
Earliest 2–5 elapsed days; total float 1. This activity has scheduling flexibility.
What if one activity changes?
Recalculate the whole network with one replacement duration. Another chain may become critical.
Turning this option off retains its draft. This is a deterministic comparison, not a completion probability or a resource-feasibility check.
Compare a finish target
The target changes the target-relative latest times and float, not the base critical chains. A negative margin means the target cannot be met with this network and its entered durations.
Follow a complete critical chain
Base project: 1 distinct critical chain. Each chain follows actual dependencies from a root activity to a terminal activity.
Activity durations 13 + waiting lags 0 = 13 elapsed days, matching the project finish.
A project can have many critical chains. Shortening one critical activity may leave another chain controlling the finish. Redundant links around zero-duration milestones can create distinct chains with identical timing.
C: Procurement
Base schedule · all times in elapsed days
- Earliest start
- 2
- Earliest finish
- 5
- Latest start
- 3
- Latest finish
- 6
- Total float
- 1
- Delay available before the project finish moves.
- Free float
- 1
- Delay available without moving a successor's earliest start.
Earliest start is the maximum predecessor finish plus its waiting lag: 2.
Latest times above preserve the earliest project finish. Float is shared along a chain: delaying one activity can consume flexibility available to others.
Why these earliest and latest times?
| Predecessor | Waiting lag | Ready time | Drives start? |
|---|---|---|---|
| A | 0 | 2 | Yes |
| Successor | Waiting lag | Latest allowed finish | Drives finish? |
|---|---|---|---|
| D | 0 | 6 | Yes |
Complete activity schedule
| Activity | Duration | ES | EF | LS | LF | TF | FF | Critical? |
|---|---|---|---|---|---|---|---|---|
| ABrief | 2 | 0 | 2 | 0 | 2 | 0 | 0 | Yes |
| BDesign | 4 | 2 | 6 | 2 | 6 | 0 | 0 | Yes |
| CProcurement | 3 | 2 | 5 | 3 | 6 | 1 | 1 | No |
| DBuild | 5 | 6 | 11 | 6 | 11 | 0 | 0 | Yes |
| EQA | 2 | 11 | 13 | 11 | 13 | 0 | 0 | Yes |
| FRelease | 0 | 13 | 13 | 13 | 13 | 0 | 0 | Yes; milestone |
Complete dependency ledger
| Link | Predecessor | Successor | Waiting lag | Ready time | Slack | Critical? |
|---|---|---|---|---|---|---|
| d1 | A | B | 0 | 2 | 0 | Yes; tight |
| d2 | A | C | 0 | 2 | 0 | No; tight |
| d3 | B | D | 0 | 6 | 0 | Yes; tight |
| d4 | C | D | 0 | 5 | 1 | No |
| d5 | D | E | 0 | 11 | 0 | Yes; tight |
| d6 | E | F | 0 | 13 | 0 | Yes; tight |
Save the complete schedule
The report contains the full problem, exact activity and dependency times, critical-path counts, optional target/scenario results, and assumptions. Diagram filters do not remove rows from the report.
Selectable report CSV
Method, assumptions and sources
The forward pass takes the greatest predecessor finish plus waiting lag. The backward pass uses the smallest successor latest start minus waiting lag, ending every branch at the common project finish. Total float is latest start minus earliest start; free float protects successors' earliest starts. Critical chains use tight links between zero-total-float activities.
Enter 1–60 activities and up to 240 dependencies. Time values are decimal or scientific notation from 0 to 1,000,000,000, with at most six effective decimal places and 64 characters. Trailing zeros do not add precision. Fractions, comma separators, expressions and negative durations/lags are not accepted. Exact integer micro-units determine ties, float and path membership.
Activities and waiting lags use one descriptive unit label. Calendar dates, weekends, holidays, resource leveling, other dependency relations and uncertainty distributions are not modeled. This schedule expresses your entered logic and durations; it does not guarantee that a real project can follow them.
How to use this calculator
- Enter a Project name and a Unit label (all values), then add one to sixty activities. Each activity has a stable ID; enter an optional Activity name and nonnegative Duration. A zero-duration activity is a milestone. The unit label is descriptive and does not convert values.
- Add finish-to-start dependencies using Predecessor, Successor and Waiting lag. A successor can start only after every predecessor finishes and its waiting lag expires. Separate roots can start together; cycles, duplicate directed links and missing activities must be corrected.
- Alternatively, choose Import format and paste the Complete problem text in the documented CSV/TSV schema. Include project, unit, activities, dependencies, target and scenario records. Replace the plan only after the whole core import validates; blank text does not load the example.
- Read the earliest modeled finish and critical-path count. Select an activity in the Gantt/network workspace to inspect its early and late timing, total float and free float. Use the dependency editor and ledger to inspect predecessor, successor and waiting-lag requirements. Follow a specific critical chain rather than treating every zero-float activity as one continuous path.
- Optionally enter a Target finish or choose an Activity to change and a Replacement duration. Compare each calculation with the unchanged baseline. A duration scenario recalculates all dependencies; total float is shared and cannot be added across activities as independent allowances.
- Open the timing and dependency ledger, then request a CSV download or select the same CSV text. Correct or disable invalid optional comparisons before complete export. Use the exact quantities for tiny durations or floats that cannot be distinguished at the chart's scale.
The Formula
The mathematical logic powering this calculation is:
For activity i with duration dᵢ, ESᵢ = max(0, max predecessor(EFₚ + lagₚᵢ)) and EFᵢ = ESᵢ + dᵢ. The earliest modeled project finish T is the largest EF. For terminal activities LFᵢ = T; otherwise LFᵢ = min successor(LSⱼ − lagᵢⱼ). Then LSᵢ = LFᵢ − dᵢ and total float TFᵢ = LSᵢ − ESᵢ. Free float is min successor(ESⱼ − lagᵢⱼ) − EFᵢ, or T − EFᵢ for a terminal activity. All disconnected components share the same project finish.
A critical activity has exactly zero total float. A critical dependency connects critical activities and binds the successor's early start exactly. Critical paths are distinct actual-root-to-terminal dependency chains, including waiting lags. Their count can be large; inspecting one chain does not imply it is the only path. Float is shared along paths, so separate activity allowances are not additive budgets for simultaneous changes.
Use one to sixty activities and zero to 240 directed dependencies. Each dependency is finish-to-start with a nonnegative waiting lag. Duplicate ordered pairs, missing endpoints, self-links and all cycles are invalid, including cycles of milestones. Zero duration is a milestone. Separate roots can start at zero; disconnected activities are valid and must all finish. Durations and waiting lags are assumptions, with required resources treated as available.
Each authored time value is a nonnegative decimal or scientific token from zero through 1e9, with at most six effective decimal places and 64 characters. Blank values, fractions, grouping commas, negative times, NaN and Infinity are rejected. Insignificant trailing zeros do not add effective precision. Exact integer micro-units decide sums, comparisons and criticality; rounded chart coordinates do not. Derived project times can exceed the input bound. The unit label describes every value without converting anything: changing days to hours does not rescale durations, lags, target or scenario.
A target finish is a separate comparison and target-based late-time/float calculation. It never replaces baseline late times or the baseline critical set. A negative target gap means the entered target precedes the earliest modeled finish, not that a calendar commitment has been assessed. A one-activity scenario replaces its duration and recomputes the entire graph; it is not a delayed-start, remaining-work or simultaneous-change model. Invalid enabled comparisons retain the baseline but block complete result export until corrected or disabled. Disabled drafts remain preserved.
The complete-input CSV/TSV header is record_type,id,label,from,to,duration,lag,value,enabled. Required records are one project, one unit, one target and one scenario, plus the activities and dependencies. The optional apostrophe-text-v1 encoding marker makes authored spreadsheet text reversible; use the documented schema and true/false booleans. Import validates the whole core plan before replacing it. Network layout expresses precedence, not elapsed distance; the Gantt view expresses the same calculated timing as the ledger.
This deterministic planner does not include dates, workdays, holidays, calendars, resource leveling, actual progress, PERT distributions or completion probabilities. It follows the forward/backward-pass and float concepts described in PMI's CPM calculation guide, CMU's Fundamental Scheduling Procedures and the GAO Schedule Assessment Guide; it does not certify compliance with those broader scheduling practices.Worked Example
If you input:
- Import format: CSV (comma separated)
- Complete problem text: record_type,id,label,from,to,duration,lag,value,enabled project,,,,,,,Launch plan, unit,,,,,,,days, activity,A,Prepare,,,2,,, activity,B,Build,,,4,,, activity,C,Review,,,3,,, activity,D,Integrate,,,5,,, activity,E,Release,,,2,,, activity,F,Finish,,,0,,, dependency,AB,,A,B,,0,, dependency,AC,,A,C,,0,, dependency,BD,,B,D,,0,, dependency,CD,,C,D,,0,, dependency,DE,,D,E,,0,, dependency,EF,,E,F,,0,, target,,,,,,,15,false scenario,C,,,,5,,,false
Result:
A takes 2 units; B takes 4 and C takes 3 after A. D takes 5 after both B and C, then E takes 2 and F is a zero-duration finish milestone. With zero waiting lags, the earliest finish is 13. The only critical chain is A → B → D → E → F. C has total float 1 and free float 1. The retained target 15 and C-duration scenario 5 are disabled in this example; enabling them gives a baseline target gap of 2 and a scenario finish of 14.
Frequently Asked Questions
What does the critical path tell me?
It identifies an actual dependency chain whose durations and waiting lags determine the earliest modeled finish. Several chains may tie. The calculator counts distinct tight critical root-to-terminal chains and lets you inspect them separately; it does not join unrelated zero-float activities into an invented path. The result depends on the durations, logic and resource-availability assumptions you entered.
What is the difference between total float and free float?
Total float compares an activity's baseline late and early starts against the earliest modeled project finish. Free float is the delay that leaves immediate successors' early starts unchanged, or leaves project finish unchanged for a terminal activity. Total float is shared along paths: spending it on one activity can consume another activity's apparent allowance. The separate duration-change scenario recomputes the whole graph rather than adding float allowances.
Are waiting lags, milestones and separate work streams supported?
Yes. Use a nonnegative waiting lag on a finish-to-start link; zero means no extra wait. An activity with duration zero is a milestone. Separate roots and disconnected components are valid and share one finish equal to the latest activity finish. Every cycle is rejected, even a cycle of zero-duration milestones. Start-to-start, finish-to-finish, start-to-finish links and negative leads are outside this model.
Does changing the unit label convert my plan?
No. The label is descriptive and applies uniformly to durations, lags, target finish and replacement duration. Changing days to hours leaves all numbers unchanged. Keep all entries in the same chosen unit. The planner has no dates, weekends, holidays or work-hour calendars, so a value labeled days is not automatically a business-day commitment.
How do a target finish and a duration scenario differ?
The target compares an entered finish with the baseline earliest finish and provides separate target-based late times and float. It does not redefine baseline criticality. The scenario replaces exactly one activity duration, recomputes the schedule and can change critical paths. It is not an actual-progress or delayed-start forecast. An invalid enabled comparison leaves the valid baseline available but blocks complete result export until that comparison is corrected or disabled.
Which values and project sizes can I enter?
Use one to sixty activities and up to 240 unique directed dependencies. Each duration, lag, enabled target and replacement duration accepts decimal/scientific notation from 0 through 1e9, up to six effective fractional places and 64 characters. Blanks and unsupported precision are errors rather than zeros. Exact micro-unit arithmetic decides timing and ties; longer derived project horizons are allowed. Network layout is a schematic of precedence, while the Gantt view uses calculated time.
Does this estimate completion probability or account for resource limits?
No. It is a deterministic finish-to-start CPM planner with the entered durations and required resources assumed available. It does not perform PERT simulation, resource leveling, calendar scheduling or contract certification. PMI's CPM calculations guide, CMU's scheduling chapter and the GAO Schedule Assessment Guide explain the underlying forward/backward passes and float concepts; real project control requires additional evidence and constraints.
Similar Calculators
Earned Value Calculator
Compare planned value, earned value and actual cost. Track project history, inspect CPI and SPI, and compare completion-cost forecasts with your budget.
Time Tracking Calculator
Track total worked time across multiple shifts and break periods with dynamic start and end inputs.
Linear Programming Calculator
Maximize or minimize a linear objective with variable bounds and constraints. Inspect simplex steps, exact certificates and equally good plans.
Business-Day Deadline Planner
Calculate deadlines forward or backward with custom workweeks, closures and special openings. Compare calendars, inspect counted dates and month-end adjustments, and export the complete audit.
