Cyclomatic complexity is used to calculate
number of independent paths in the basis set of a program
number of binary decisions + 1
upper bound for the number of tests that must be conducted to ensure that all statements have been executed at least once
number of branches and decisions