cyclomatic complexity (redirected from Conditional complexity)

cyclomatic complexity

A measurement of the intricacy of a program module based on the number of repetitive cycles or loops that are made in the program logic. It is used as a general measure of complexity for software quality control as well as to determine the number of testing procedures.

---

cyclomatic complexity [¦st·klə‚mad·ik kəm′plek·səd·ē]

(computer science)

A measure of the complexity of a software module, equal toe-n+ 2, whereeis the number of edges in the control flow graph andnis the number of nodes in this graph (that is, the cyclomatic number of the graph plus one).

---

(programming, testing)

cyclomatic complexity - 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.