cyclomatic complexity

from The Free On-line Dictionary of Computing (8 July 2008)
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.

   (1998-03-17)
    

[email protected]