Cyclomatic complexity: Is a metric that provides a quantitative measure of the logical complexity of a program.It defines number of independent paths in the basis set.
Cyclomatic comlexity V(G)=
--> Number of edges-number of nodes + 1 --> Number of predicate nodes + 1 --> Independent region + 1
Ready to start your tutorial with us? That's great! Send us an email and we will get back to you as soon as possible!