Which one of the following is used to compute cyclomatic complexity ?
A. The number of regions – 1
B. E – N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes.
C. P – 1, where P is the number of predicate nodes in the flow graph G.
D. P + 1, where P is the number of predicate nodes in the flow graph G.
Answer:D
Which one of the following is used to compute cyclomatic complexity ?
A. The number of regions – 1 B. E – N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. C. P – 1, where P is the number of predicate nodes in the flow graph G. D. P + 1, where P is the number of predicate nodes in the flow graph G.