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.
copied from cf-post-staging / r-cyclocomp| Label | Latest Version |
|---|---|
| main | 1.1.2 |
| cf201901 | 1.1.0 |
| cf202003 | 1.1.0 |
| gcc7 | 1.1.0 |
