Cyclomatic Complexity is computed as ___________ .
A. The number of regions of the flow graph corresponds to the Cyclomatic Complexity.
B. Cyclomatic Complexity, V(G), for a flow graph, G, is defined as V(G) = E - N + 2 where E is the number of flow graph edges, N is the number of flow graph nodes.
C. Cyclomatic Complexity, V(G), for a flow graph, G, is also defined as V(G) = P + 1 where P is the number of predicate nodes contained in the flow graph G.
D. All of the above.
Answer:A
Cyclomatic Complexity is computed as ___________ .
A. The number of regions of the flow graph corresponds to the Cyclomatic Complexity. B. Cyclomatic Complexity, V(G), for a flow graph, G, is defined as V(G) = E - N + 2 where E is the number of flow graph edges, N is the number of flow graph nodes. C. Cyclomatic Complexity, V(G), for a flow graph, G, is also defined as V(G) = P + 1 where P is the number of predicate nodes contained in the flow graph G. D. All of the above.