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 ?
Statically analyzing the cyclomatic Complexity, we find that, the computed value of F test statistics (3.
Table 1: Metrics Considered for the Study Metric Description CSTM Number of statements of server components executed in response to requests coming from a client side form ICC Number of independent paths in the inter- procedural control flow graph Sensitive Data Accesses Proportion of the number of "sensitive" (SDA) data accessed by the server side script Cyclomatic Complexity The Cyclomatic Complexity of the server (CYCM) side script NClientScriptComp Total Number of Client Script Components NServerScriptComp Total Number of Server Script Components NC Total Number of Classes NM Total Number of Methods NFormE Total Number of form elements Table 3: Classification Accuracy of Multi-Swarm PSO Data Set Multi-Swarm PSO Training 73.
It is based on the cyclomatic complexity theory by McCabe and always generates the basis path set through the baseline method [15].
Cyclomatic complexity pioneer Tom McCabe set the table by sharing his latest work on group theory in mathematics and its application to human consciousness and knowledge discovery.
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.
6 CYCLOMATIC COMPLEXITY NUMBER: ANALYSIS OF ITS DESIGN.
Cyclomatic Complexity (CC)--in object-oriented design, the metrics represents the complexity of a method and indirectly also complexity of a class.
The themes that would later form reengineering technology--coding style, improved code structure, cohesion, coupling, cyclomatic complexity, Halstead metrics, module decomposition principles, and so forth--were also being developed in technical reports, papers and books.
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.