Understanding Cyclomatic complexity of a simple condition

Question

I am trying to understand the cyclomatic complexity concept and came across in web that the cyclomatic complexity for below code (pseudo) is 3, but I thought, as there are 4 possible test scenarios, cyclomatic complexity has to be 4

If (Condition 1)
Statement 1

Else
Statement 2

If (Condition 2)
Statement 3

Else
Statement 4

Could you please help me understand.

Thanks

4 possible test scenarios are:

condition1 = true, condition2 = true;
condition1 = true, condition2 = false;
condition1 = false, condition2 = true;
condition1 = false, condition2 = false;

You might want to also include your web reference or at least include the original reasoning which led to a complexity of 3. — Tim Biegeleisen, Oct 27 '22 at 16:03

score 0 · Answer 1 · answered Oct 27 '22 at 16:14

0

I think you confused between path coverage and cyclomatic complexity

cyclomatic complexity <= number of paths

https://en.wikipedia.org/wiki/Cyclomatic_complexity

answered Oct 27 '22 at 16:14

Lior Tabachnik

113
7

Understanding Cyclomatic complexity of a simple condition

1 Answers1