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.

Last updated: 1998-03-17

Nearby terms:

cyclic redundancy codeCyclocyclomatic complexityCygnus Tcl Toolscylinder

Try this search on Wikipedia, OneLook, Google


Loading