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.
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 1.1.0-7.fc35 | - |
Fedora 35 | 1.1.0-7.fc35 | - |
Fedora 34 | 1.1.0-5.fc34 | - |
You can contact the maintainers of this package via email at
R-cyclocomp dash maintainers at fedoraproject dot org
.