Type the three V(G) computations for the BorrowBox late-fee flow graph. Computing it three ways is how you know your graph is right.

Answer

Flow graph: E = 8 edges, N = 6 nodes, P = 3 predicate nodes V(G) = E - N + 2 = 8 - 6 + 2 = 4 V(G) = P + 1 = 3 + 1 = 4 V(G) = regions = 4 => basis set has 4 independent paths -> 4 test cases

The three formulas are a self-check, not three facts to memorise separately: they agree only when the graph is drawn correctly, so a disagreement tells you a compound condition was collapsed into one node. Typing the arithmetic rather than reading it is what makes the count reproducible in an exam, where you will have to draw the graph yourself before any number is available.

Pressman 9e ch19 §19.4