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 report also draws conclusions that may apply equally to open source and commercial software regarding the relationship between variables such as code base size, defect density, function length, Cyclomatic complexity and Halstead effort.
Cyclomatic Complexity (CC)--in object-oriented design, the metrics represents the complexity of a method and indirectly also complexity of a class.
The extended cyclomatic complexity (ECC) is included in the calculation of the MI which makes CC highly correlated to the MI values [6, 7].
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.
It was found when comparing with extracted metrics such as Lines of code (LOC) and Cyclomatic complexity (V(G)) which were traditionally used for risk prediction [8], [9] in this kind of software systems, Halstead program difficulty (D), Number of executable statements (EXEC) and Halstead program volume (V) were more useful.
Description: Cyclomatic complexity (V(G)) is a measure of the complexity of the function's decision structure.
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.
The reports generated as part of the application assessment included critical metrics such as volume and cyclomatic complexity, code change frequency, and code replication levels.
6 CYCLOMATIC COMPLEXITY NUMBER: ANALYSIS OF ITS DESIGN.
The prototype open-source tool uses cyclomatic complexity and code coverage from automated tests to calculate a score for Java code.
Visual Recap generates industry-standard metrics, such as function points and cyclomatic complexity, and then formats them into easy-to-read reports and charts that can help manage projects and verify the results.