Cyclomatic Complexity is a metric that measures the complexity of a program by counting the number of different paths through the code. It is a quantitative measure of the number of linearly independent paths through a program\'s source code. The metric was developed by Thomas J. McCabe, Sr. in 1976 and is based on the control flow of the program.
We have a blog post that explains cyclomatic complexity and CRAP in detail.
With OtterWise, you can track Code Coverage, test performance, contributor stats, code health, and much more.
