
436 ◾ Software Metrics
leads to a dierent set of testing paths:
< 6,5,6,2>, <6,2>, <4,1,5,6,2>.
In fact, we can show that if all predicate nodes have outdegree 2 then
ν(G) = d + 1 where d is the number of predicate nodes in G. For if there are
p procedure nodes, then n = p + d + 1 since the nodes of G are the proce-
dure nodes, the predicate nodes, plus a single stop node. Now, e = p + 2d
since each procedure node contributes 1 to the total number of edges and
each predicate node contributes 2. us, e − n + 2 = (p + 2d) − (p + d + 1) +
2 = d + 1.
A.2 Computing Test Coverage Measures
Measurement Values for Primes
Test Strategy P
1
D
0
D
1