Consider a program ?ow diagram as a directed graph in which the diamonds and boxes of the
Fantastic news! We've Found the answer you've been seeking!
Question:
Consider a program ?ow diagram as a directed graph in which the diamonds and boxes of the program are nodes, and the logic ?ow arrows between them are directed edges.
Prove that statement testing of a program is equivalent to ?nding a path in the graph that contains all nodes of the graph. Prove that branch testing is equivalent to ?nding the set of paths whose union covers the edges.
Finally, prove that path testing is equivalent to ?nding all possible paths through the graph.
Related Book For
Posted Date: