Cyclomatic Complexity.ppt

Cyclomatic Complexity Dan Fleck Fall 2007 What is it? A software metric used to measure the complexity of software Developed by Thomas McCabe Described (informally) as the number of decision points + 1 What is the complexity? What is the complexity V(G)? Output from JavaNCSS * * Cyclomatic Complexity V(G) Computing the cyclomatic complexity: number of simple decisions + 1 or number of enclosed areas + 1 In this case, V(G) = 4 From Pressman Slides - Software Engineering a Practical Approach 6,e Graph Complexity (Cyclomatic Complexity) A number of industry studies have indicated that the higher V(G), the higher the probability or errors. V(G) modules modules in this range are more error prone From Pressman Slides - Software Engineering a Practical Approach 6,e Basis Path Testing Next, we derive the independent paths: Since V(G) = 4, there are four paths Path 1: 1,2,3,6,7,8 Path 2: 1,2,3,5,7,8 Path 3: 1,2,4,7,8 Path 4: 1,2,4,7,2,4,...7,8 Finally, we derive test cases to exercise these paths. 1 2 3 4 5 6 7 8 From Pressman Slides - Software Engineering a Practical Approach 6,e public void howComplex() { int i=20; while (i10) { System.out.printf(i is %d, i); if (i%2 == 0) { System.out.println(even); } else { System.out.println(odd); } } } public void howComplex() { int i=20; while (i10) { System.out.printf(i is %d, i); if (i%2 == 0) { System.out.println(even); } else { System.out.println(odd); } } } V(G) = 2 enclosed area + 1 = 3 *