Cyclomatic complexity

Cyclomatic complexity. Cyclomatic complexity of a program is a structural (or topological) measure of programs' complexity for measuring software quality. 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. 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 methods.

References

• Wikipedia. Cyclomatic complexity
• T.J. McCabe, "A complexity measure," IEEE Transactions on Software Engineering, vol. SE-2, no. 4, pp. 308-320, December, 1976.
• PVS-Studio Documentation. V2008. Cyclomatic complexity: NN. Consider refactoring the 'Foo' function.

0

0

0

SHARE

We can email you a selection of our best articles once a month

By clicking this button you agree to our Privacy Policy statement