An Implementation of the Critical Path Method

An R6 object oriented implementation of the Critical Path Method (CPM). CPM is a method used to estimate the minimum project duration and determine the amount of scheduling flexibility on the logical network paths within the schedule model. The flexibility is in terms of early start, early finish, late start, late finish, total float and free float. Beside, it permits to quantify the complexity of network diagram through the analysis of topological indicators. Finally, it permits to change the activities duration to perform what-if scenario analysis. The package was built based on following references: To make topological sorting and other graph operation, we use Csardi, G. & Nepusz, T. (2005) <>; For schedule concept, the reference was Project Management Institute (2017) <>; For standards terms, we use Project Management Institute (2017) <>; For algorithms on Critical Path Method development, we use Vanhoucke, M. (2013) and Vanhoucke, M. (2014) ; And, finally, for topological definitions, we use Vanhoucke, M. (2009) .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.1.0 by Rubens Jose Rosa, 5 months ago,

Report a bug at

Browse source code at

Authors: Rubens Jose Rosa [aut, cre] , Marcos dos Santos [aut] , Thiago Marques [aut]

Documentation:   PDF Manual  

MIT + file LICENSE license

Imports igraph, R6

Suggests DiagrammeR, knitr, rmarkdown, testthat

See at CRAN