# Cyclomatic complexity

Cyclomatic complexity\. Cyclomatic complexity of a program is a structural \(or topological\) measure of programs' complexity for measuring [software quality](https://pvs-studio.com/en/blog/terms/0029/)\. Cyclomatic complexity measuring allows you to evaluate the quality of the program code and detect high\-complexity procedures\. High\-complexity procedures are subject to errors and detecting them is highly required to perform [code review](https://pvs-studio.com/en/blog/terms/0073/)\. Program cyclomatic complexity was the first topological complexity measure which was used in practice and became basis for many modifications\. Measuring of cyclomatic complexity relates to [static code analysis](https://pvs-studio.com/en/blog/terms/0046/) methods\.

## References

1. Wikipedia\. [Cyclomatic complexity](https://en.wikipedia.org/wiki/Cyclomatic_complexity)
1. T\.J\. McCabe, "A complexity measure," IEEE Transactions on Software Engineering, vol\. SE\-2, no\. 4, pp\. 308\-320, December, 1976\.
1. PVS\-Studio Documentation\. V2008\. [Cyclomatic complexity: NN\. Consider refactoring the 'Foo' function](https://pvs-studio.com/en/docs/warnings/v2008/)\.