cyclomatic complexity
English
Noun
cyclomatic complexity (countable and uncountable, plural cyclomatic complexities)
- (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
|
Further reading
cyclomatic complexity on Wikipedia.Wikipedia
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.