Slide 11
Slide 11 text
Cyclomatic Complexity
The cyclomatic complexity of a section of source code is the number of
linearly independent paths within it.
4 If the source code contained no control flow statements (conditionals
or decision points), the complexity would be 1.
4 One IF statement = two paths through the code, complexity would be 2.
4 Two nested single-condition IFs, or one IF with two conditions, would
produce a complexity of 3.
https://en.wikipedia.org/wiki/Cyclomatic_complexity