Question: Cyclomatic complexity can be calculated by: (a) V(G)= e-n+2P (b) V(G)= +1 (c) V(G)= number of regions of the graph (d) All of the above
Cyclomatic complexity can be calculated by:
(a) V(G)= e-n+2P
(b) V(G)= +1
(c) V(G)= number of regions of the graph
(d) All of the above
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
