cyclomatic complexity


Also found in: Wikipedia.

cyclomatic complexity

[¦st·klə‚mad·ik kəm′plek·səd·ē]
(computer science)
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.

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.
Mentioned in ?
References in periodicals archive ?
The McCabe cyclomatic complexity metric typically used in software and communication networks can be applied to almost any complex system, including the human physiology and biological ecosystems.
Cyclomatic Complexity: The complexity of the codes were calculated using a plugin of Eclipse IDE tool, Metrics.
Cyclomatic Complexity is used to identify the complexity of a piece of code based on the amount of execution flows [26].
En este articulo en particular tomaremos uno de los aspectos denominado "Complejidad Ciclomatica (Cyclomatic Complexity)" con la intencion de dejar planteado que podria ocurrir con la misma en caso de llevarse adelante la practica descripta.
It was found that there is a very strong correlation between Lines of Code and Halstead Volume; there is an even stronger correlation between Lines of Code and McCabe's Cyclomatic Complexity; and none of the internal software metrics makes it possible to discern correct programs from incorrect ones [11].
It is based on the cyclomatic complexity theory by McCabe and always generates the basis path set through the baseline method [15].
The lines of the collision avoidance system are 213 and cyclomatic complexity is 19.
The complexity of the program was evaluated using the value of M, the Cyclomatic Complexity (CC) of McCabe (1976) [41].
Results show that comparing with metrics such as Lines of code (LOC) and Cyclomatic complexity (V(G)) which are traditionally used for risk prediction, Halstead program difficulty (D), Number of executable statements (EXEC) and Halstead program volume (V) are the more effective metrics as risk predictors.
Another addition is the expanded metrics that may be viewed, including McCabe's Cyclomatic Complexity and Halstead Software Science Volume across mainframe and distributed technologies.
Cyclomatic complexity - a measure of the number of decisions in a module, subprogram, or object of code [9] - should never exceed nine.
Although their quality attributes include dynamic indicators like coupling, most of them are extended from the traditional static complexity metrics such as LOC or McCabe cyclomatic complexity.