cyclomatic complexity(redirected from Conditional complexity)
cyclomatic complexity[¦st·klə‚mad·ik kəm′plek·səd·ē]
A measure of the complexity of a software module, equal to e-n + 2, where e is the number of edges in the control flow graph and n is the number of nodes in this graph (that is, the cyclomatic number of the graph plus one).
cyclomatic complexity(programming, testing)
A measure of the number of linearly independent paths through a program module. Cyclomatic complexity is a measure for the complexity of code related to the number of ways there are to traverse a piece of code. This determines the minimum number of inputs you need to test all ways to execute the program.