0
N is the number of nodes of the control graph and E is the number of edges in the control flow graph. What is Mc Cabe's cyclomatic complexity V(G)?
- AV(G) = E - N - 2
- BV(G) = E + N - 2
- CV(G) = E + N + 2
- DV(G) = E - N + 2
Correct answer: D
N is the number of nodes of the control graph and E is the number of edges in the control flow graph. What is Mc Cabe's cyclomatic complexity V(G)?