The concept, although not the method, is somewhat similar to that of general text complexity measured by the Flesch-Kincaid Readability Test.
Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to the commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command.
The cyclomatic number, also known as the _the_first_Betti_number_in_graph_theory, is defined as:
For a program with multiple exits (return statements), the definition is instead:
"M" is alternatively defined to be one larger than the number of decision points (if/case-statements, while-statements, etc) in a module (function, procedure, chart node, etc.), or more generally a system.
Separate subroutines are treated as being independent, disconnected components of the program's control flow graph.
There is another simple way to determine the cyclomatic number. This is done by counting the number of closed loops in the flow graph, and incrementing the number by the number of exit points.
For a connected graph with a single exit point, this is simply the number of closed loops + 1.
This corresponds to the intuitive notion of cyclomatic complexity, and can be calculated as above.
Alternatively, one can compute this via absolute Betti number (absolute homology – not relative) by identifying (gluing together) all terminal nodes on a given component (or equivalently, draw paths connecting the exits to the entrance), in which case (calling the new, augmented graph , which is ), one obtains:
This corresponds to the characterization of cyclomatic complexity as “number of loops plus number of components”.
For example, consider a program that consists of two sequential if-then-else statements.
The name Cyclomatic Complexity carries certain ambiguity, as this metric does not only count cycles (loops) in the program. It is motivated by the number of different cycles in the program control flow graph, after having added an imagined branch back from the exit node to the entry node, see [McCabe76], p. 309.
A better name for popular usage would be Conditional Complexity, as "it has been found to be more convenient to count conditions instead of predicates when calculating complexity" [McCabe76], p. 315.
The cyclomatic complexity of a section of source code is the count of the number of linearly independent paths through the source code. For instance, if the source code contained no decision points such as IF statements or FOR loops, the complexity would be 1, since there is only a single path through the code. If the code had a single IF statement containing a single condition there would be two paths through the code, one path where the IF statement is evaluated as TRUE and one path where the IF statement is evaluated as FALSE.
Cyclomatic complexity is normally calculated by creating a graph of the source code with each line of source code being a node on the graph and arrows between the nodes showing the execution pathways. As some programming languages can be quite terse and compact, a source code statement when developing the graph may actually create several nodes in the graph (for instance, when using the "?:" ternary conditional operator in C, C++, C# and Java).
In general, in order to fully test a module all execution paths through the module should be exercised. This implies a module with a high complexity number requires more testing effort than a module with a lower value since the higher complexity number indicates more pathways through the code. This also implies that a module with higher complexity is more difficult for a programmer to understand since the programmer must understand the different pathways and the results of those pathways.
One would also expect that a module with higher complexity would tend to have lower cohesion (less than functional cohesion) than a module with lower complexity. The possible correlation between higher complexity measure with a lower level of cohesion is predicated on a module with more decision points generally implementing more than a single well defined function. However there are certain types of modules that one would expect to have a high complexity number, such as user interface (UI) modules containing source code for data validation and error recovery.
Geometric Complexity Analysis in an Integrative Technology Evaluation Model (Item) for Selective Laser Melting (Slm)#
Jul 01, 2012; ABSTRACT Selective laser melting (SLM) is becoming an economically viable choice for manufacturing complex serial parts. This...
US Patent Issued to International Business Machines on Jan. 4 for "System and Methods for Integrating Authoring with Complexity Analysis for Computing System Operation Procedures" (New York, California Inventors)
Jan 10, 2011; ALEXANDRIA, Va., Jan. 10 -- United States Patent no. 7,865,335, issued on Jan. 4, was assigned to International Business Machines...
Researchers Submit Patent Application, "Method and Apparatus for Performing Dynamic Textual Complexity Analysis Using Machine Learning Artificial Intelligence", for Approval
Nov 11, 2013; By a News Reporter-Staff News Editor at Robotics & Machine Learning -- From Washington, D.C., VerticalNews journalists report...