Go to content
Use the diagram below to practise using the critical path method on an activity network. Click on a node to enter values for the earliest start (ES), earliest finish (EF), latest start (LS), latest finish (LF) and total float (TF).

A Java applet freely available from James Lamb (web site no longer available).

## Glossary

### network

A graph that has a number associated with each edge.

### node

A point or vertex of a graph.

### path

A finite sequence of edges such that the end vertex of one edge in the sequence is the start vertex of the next and in which no vertex appears more than once.

### total float

The total float F(i,j) of activity (i,j) is defined to be F(i,j) = lj - ei - duration (i, j), where ei is the earliest time for event i and lj is the latest time for event j.

Full Glossary List

## This question appears in the following syllabi:

SyllabusModuleSectionTopicExam Year
AQA A-Level (UK - Pre-2017)D2Critical path analysisNetworks-
AQA AS Further Maths 2017Discrete MathsCritical Path AnalysisActivity Networks-
AQA AS/A2 Further Maths 2017Discrete MathsCritical Path AnalysisActivity Networks-
Edexcel A-Level (UK - Pre-2017)D1Critical path analysisNetworks-
Edexcel AS Further Maths 2017Decision Maths 1Critical Path AnalysisActivity Networks-
Edexcel AS/A2 Further Maths 2017Decision Maths 1Critical Path AnalysisActivity Networks-
OCR A-Level (UK - Pre-2017)D2Critical path analysisNetworks-
OCR AS Further Maths 2017Discrete MathsDecision Making in Project ManagementActivity Networks-
OCR MEI AS Further Maths 2017Modelling with AlgorithmsCritical Path AnalysisActivity Networks-
OCR-MEI A-Level (UK - Pre-2017)D1Critical path analysisNetworks-
Universal (all site questions)CCritical path analysisNetworks-