cyclomatic complexity

Noun

 * 1)  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.

Translations

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