How to use the Critical Path Calculator.
Critical-path calculations require an acyclic dependency graph and consistent units. A changed duration can move the critical path.
Make the workflow fit your task.
Represent tasks as durations and predecessor links, reject circular dependencies and calculate the longest dependent path. Report the project duration under the stated assumptions and re-evaluate it when a duration changes.
- What you provide
- Task durations and dependency graph.
- What you get
- Critical path and float using deterministic graph calculations.
See the input and the result.
Illustrative input and output · a teaching example, not a live WebAct run
Example input
A: 2 days; B: 3 days after A; C: 1 day after A.
Completed example
Critical path A → B totals 5 days. The A → C branch totals 3 days under these assumptions.
Load this input into the prompt, then copy it to WebAct to try the task. Your result may differ from the illustration.
Decisions and troubleshooting.
Is the longest individual task always on the critical path?
No. The critical path is the longest dependent sequence. Several shorter tasks can form a longer controlling path.
Why does changing one task move the critical path?
Another branch may become longer after the change. Recalculate the whole dependency graph rather than updating only the previous critical sequence.
Try it with your own source.
Replace the example with your material in the task prompt. Keep the requirements you need, then copy the task into WebAct.
Customize and copy the task ↑