华中科技大学软件质量与测试课件 基路径测试.pptVIP

2.3 Basis Cyclomatic complexity V(G)=#nodes +1 2.3 Basis Cyclomatic complexity V(G)=#nodes +1 2.3 Basis 2.3 Basis 2.3 Basis V(G)=6 Is it simple? * 2.5 Design of test cases Independent paths k1*P1=k2*P2+k3*P3+k4*P4+k5*P5 Paths 1 2 3 4 5 6 7 8 9 10 K1*P1 K1 0 0 k1 0 0 0 0 k1 0 K2*P2 0 K2 0 0 0 0 k2 0 0 k2 K3*P3 k3 0 0 0 k3 0 0 k3 0 k3 K4*P4 k4 0 k4 2k4 0 0 0 0 k4 0 K5*P5 0 K5 0 0 0 k5 0 k5 0 k5 * 2.5 Design of test cases Independent paths k1*P1=k2*P2+k3*P3+k4*P4+k5*P5 K1=k3+k4 0=k2+k5 0=k4 K1=2*k4 0=k3 0=k5 0=k2 0=k3+k5 K1=k4 0=k2+k3+k5 * 2.5 Design of test cases Try to test it using path