The Cyclomatic Complexity calculator computes a complexity factor based on the number of edges, nodes, and exit nodes.
INSTRUCTIONS: Enter the following:
- (E) Edges
- (N) Nodes
- (P) Exit Nodes
Cyclomatic Complexity (CC): The calculator returns the factor as a real number.
The Math / Science
The Cyclomatic Complexity estimation technique is used to compute the complexity of a program, algorithm, function, module, method, or class by computing the number of linearly independent paths through the code. The computation of the cyclomatic complexity is abstracted from the control flow graph of the program. The nodes of the graph correspond to functionally indivisible code blocks and edges connect two nodes when successive blocks must execute one after the other.
The formula for Cyclomatic Complexity is:
CC = E - N + 2 * P
where:
- CC = Cyclomatic Complexity
- E = Number of Edges
- N = Number of Nodes
- P = Number of Exit Nodes
Computer Science Calculators
- Convert Integer to Binary
- Convert Binary to Integer
- Convert Integer to Octal
- Convert Integer to Hex
- Convert Binary to Hex
- Convert Binary to Octal
- Convert Hex to Decimal
- Convert Hex to Octal
- Convert Octal to Decimal
- Convert Octal to Binary
- Convert Octal to Hex
- Pick a Number between 1 and 31 (binary game)
- Character to Unicode
- Binary Math
- Octal Math
- Hex Math
- Cyclomatic Complexity