Cyclomatic Complexity - Features, Properties - Software Testing Techniques

Q.  Cyclomatic Complexity is computed as ___________ .
- Published on 30 Jul 15

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: All of the above.

Related Content

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲