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 ==== Translations ==== === Further reading === cyclomatic complexity on Wikipedia.Wikipedia