cyclomatic complexity noun1 •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. formscyclomatic complexities
