McCabe’s Cyclomatic Complexity

• Based on the control graph of the program

• Can be used to decide on basis path testing etc.

• no. linearly independent paths =

no. of edges - no of nodes + 2*modules

Previous slide

Next slide

Back to first slide

View graphic version