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 mango-solutions.com> |
| BugReports: | https://github.com/MangoTheCat/cyclocomp/issues |
| License: | MIT + file LICENSE |
| URL: | https://github.com/MangoTheCat/cyclocomp |
| 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: cyclocomp_1.1.0.zip, r-release: cyclocomp_1.1.0.zip, r-oldrel: cyclocomp_1.1.0.zip |
| macOS binaries: | r-release (arm64): cyclocomp_1.1.0.tgz, r-oldrel (arm64): cyclocomp_1.1.0.tgz, r-release (x86_64): cyclocomp_1.1.0.tgz, r-oldrel (x86_64): cyclocomp_1.1.0.tgz |
| Old sources: | cyclocomp archive |
| Reverse imports: | goodpractice, lintr |
Please use the canonical form https://CRAN.R-project.org/package=cyclocomp to link to this page.