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-15.fc40 | - |
Fedora 40 | 1.1.0-15.fc40 | - |
Fedora 39 | 1.1.0-13.fc39 | - |
Fedora 38 | 1.1.0-12.fc38 | - |
You can contact the maintainers of this package via email at
R-cyclocomp dash maintainers at fedoraproject dot org
.