Nothing
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.
Package details |
|
---|---|
Author | Gabor Csardi |
Maintainer | Gabor Csardi <csardi.gabor@gmail.com> |
License | MIT + file LICENSE |
Version | 1.1.1 |
URL | https://github.com/gaborcsardi/cyclocomp |
Package repository | View on CRAN |
Installation |
Install the latest version of this package by entering the following in R:
|
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.