cyclomatic complexity
Short definition from Wiktionary
Noun
- 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.
We haven’t written up cyclomatic complexity yet: Simple and Standard meanings, examples and a quiz.