cyclomatic complexity

English

Noun

cyclomatic complexity (countable and uncountable, plural cyclomatic complexities)

1. (software engineering) A quantitative measure of the number of linearly independent paths (branches) through a program's source code which indicates the complexity of a program or a function.

   Synonym: McCabe's complexity

   • 2006, Linda M. Laird, M. Carol Brennan, Software Measurement and Estimation: A Practical Approach, John Wiley & Sons, →ISBN, page 61:

     Cyclomatic complexity to us seems to be more of a problem when maintaining and testing code, rather than when originally writing it. As the cyclomatic complexity increases, the difficulty of fixing the code increases.

Translations

quantitative measure

• German: McCabe-Metrik f, zyklomatische Komplexität f
• Indonesian: kompleksitas siklomatik

Further reading

• cyclomatic complexity on Wikipedia.Wikipedia