# Cyclomatic Complexity

Last Updated : 12 Mar, 2024

Pre-Requisite: Complexity of a Program

The cyclomatic complexity of a code section is the quantitative measure of the number of linearly independent paths in it. It is a software metric used to indicate the complexity of a program. It is computed using the Control Flow Graph of the program. The nodes in the graph indicate the smallest group of commands of a program, and a directed edge in it connects the two nodes i.e. if the second command might immediately follow the first command.

For example, if the source code contains no control flow statement then its cyclomatic complexity will be 1, and the source code contains a single path in it. Similarly, if the source code contains one if condition then cyclomatic complexity will be 2 because there will be two paths one for true and the other for false.Â

Mathematically, for a structured program, the directed graph inside the control flow is the edge joining two basic blocks of the program as control may pass from first to second.Â
So, cyclomatic complexity M would be defined as,Â

M = E – N + 2P where E = the number of edges in the control flow graphÂ
N = the number of nodes in the control flow graphÂ
P = the number of connected componentsÂ

In case, when exit point is directly connected back to the entry point. Here, the graph is strongly connected, and cyclometric complexity is defined as

M = E – N + P

where

E = the number of edges in the control flow graphÂ
N = the number of nodes in the control flow graphÂ
P = the number of connected componentsÂ

In the case of a single method, P is equal to 1. So, for a single subroutine, the formula can be defined as

M = E – N + 2

where

E = the number of edges in the control flow graphÂ
N = the number of nodes in the control flow graphÂ
P = the number of connected componentsÂ

## How to Calculate Cyclomatic Complexity?

Steps that should be followed in calculating cyclomatic complexity and test cases design are:Â Â

Construction of graph with nodes and edges from code.

• Identification of independent paths.
• Cyclomatic Complexity Calculation
• Design of Test Cases

Let a section of code as such:Â

`A = 10   IF B > C THEN      A = B   ELSE      A = C   ENDIFPrint APrint BPrint C`

Control Flow Graph of the above code

Cyclomatic Complexity

The cyclomatic complexity calculated for the above code will be from the control flow graph. The graph shows seven shapes(nodes), and seven lines(edges), hence cyclomatic complexity is 7-7+2 = 2.Â

## Use of Cyclomatic Complexity

• Determining the independent path executions thus proven to be very helpful for Developers and Testers.
• It can make sure that every path has been tested at least once.
• Thus help to focus more on uncovered paths.
• Code coverage can be improved.
• Risks associated with the program can be evaluated.
• These metrics being used earlier in the program help in reducing the risks.

• It can be used as a quality metric, given the relative complexity of various designs.
• It is able to compute faster than Halstead’s metrics.
• It is used to measure the minimum effort and best areas of concentration for testing.
• It is able to guide the testing process.
• It is easy to apply.

• It is the measure of the program’s control complexity and not the data complexity.
• In this, nested conditional structures are harder to understand than non-nested structures.
• In the case of simple comparisons and decision structures, it may give a misleading figure.

## Important Questions on Cyclomatic Complexity

1. Consider the following program module.

`int module1 (int x, int y) {   while (x!=y){      if(x>y)         x=x-y,      else y=y-x;      }   return x;}`

What is the Cyclomatic Complexity of the above module? [GATE CS 2004]

(A) 1

(B) 2

(C) 3

(D) 4

2. With respect to software testing, consider a flow graph G with one connected component. Let E be the number of edges, N be the number of nodes, and P be the number of predicate nodes of G. Consider the following four expressions:

`i. E-N+Pii. E-N+2iii. P+2iv. P+1`

The cyclomatic complexity of G is given by [GATE CS 2006]

(A) 1 or 3

(B) 2 or 3

(C) 2 or 4

(D) 1 or 4

3. What is the appropriate pairing of items in the two columns listing various activities encountered in a software lifecycle? [GATE CS 2010]

 P. Requirements Capture 1. Module Development and Integration Q. Design 2. Domain Analysis R. Implementation 3. Structural and Behavioural Modeling S. Maintenance 4. Performance Tuning

(A) P-3, Q-2, R-4, S-1

(B) P-2, Q-3, R-1, S-4

(C) P-3, Q-2, R-1, S-4

(D) P-2, Q-3, R-4, S-1

## FAQs on Cyclomatic Complexity

### 1. What is Cyclometric Complexity?

Cyclometric Complexity is basically a software metric that is used to determine the complexity of a program.

### 2. Why it is recommended to reduce Cyclometric Complexity?

High Cyclometric Complexity can lead to difficulties in code and also increases the risk of errors in code.