cyclocomp: Cyclomatic Complexity of R Code

Cyclomatic complexity is a software metric (measurement), used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's source code. It was developed by Thomas J. McCabe, Sr. in 1976.

Version: 1.1.0
Imports: callr, crayon, desc, remotes, withr
Suggests: testthat
Published: 2016-09-10
Author: Gabor Csardi
Maintainer: Gabor Csardi <gcsardi at>
License: MIT + file LICENSE
NeedsCompilation: no
Materials: README NEWS
CRAN checks: cyclocomp results


Reference manual: cyclocomp.pdf
Package source: cyclocomp_1.1.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X El Capitan binaries: r-release: cyclocomp_1.1.0.tgz
OS X Mavericks binaries: r-oldrel: cyclocomp_1.1.0.tgz
Old sources: cyclocomp archive


Please use the canonical form to link to this page.