Which one of the following statements is incorrect?
A. The number of regions corresponds to the cyclomatic complexity.
B. Cyclometric complexity for a flow graph G is V (G) = N – E + 2, where E is the number of edges and N is the number of nodes in the flow graph.
C. Cyclometric complexity for a flow graph G is V (G) = E – N + 2, where E is the number of edges & N is the number of nodes in the flow graph.
D. Cyclometric complexity for a flow graph G is V (G) = P + 1, where P is the number of predicate nodes contained in the flow graph G.
Answer:C
Which one of the following statements is incorrect?
A. The number of regions corresponds to the cyclomatic complexity. B. Cyclometric complexity for a flow graph G is V (G) = N – E + 2, where E is the number of edges and N is the number of nodes in the flow graph. C. Cyclometric complexity for a flow graph G is V (G) = E – N + 2, where E is the number of edges & N is the number of nodes in the flow graph. D. Cyclometric complexity for a flow graph G is V (G) = P + 1, where P is the number of predicate nodes contained in the flow graph G.