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.
Related Concepts: Cyclomatic complexity is often used alongside other code quality metrics and is a key factor in calculating CRAP (Change Risk Anti-Patterns). High complexity often contributes to technical debt and can indicate the presence of code smells.
Setting appropriate coverage thresholds and using status checks can help manage complexity in pull requests.
With OtterWise, you can track Code Coverage, contributor stats, code health, and much more.
