cyclomatic complexity  measures the quantitative measure of 
the logical complexicity
NO of conditions+1

cyclomatic complexity  measures the quantitative measure of 
the logical complexicity
NO of conditions+1

cyclomatic complexity  measures the quantitative measure of 
the logical complexicity
NO of conditions+1

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

Note: Predicate nodes means conditions.

thanx

cyclomatic complexity is technique of whitebox testing. its 
requires internal logic. i.e.coding part          
Cyclomatic comlexity V(G)= 

       --> Number of edges-number of nodes + 1
       --> Number of predicate nodes + 1
       --> Independent region + 1

Cyclomatic complexity is no of independent paths in a 
program.It is calculated using the formula L-N+2P where L 
is no of links,N is no of nodes and P is no of independent 
paths

Shortcut for calculating CC:

No of Decisions + 1

1.) no. of regions of the flow graph correspond to the 
cyclomatic complexity.
2.)cyclomatic complexity, V(G), for a flow graph, G, is 
defined as V(G)=E-N+2
where E is the no. of flow graph edges, N is the no. of 
flow graph nodes.
3.)cyclomatic compexity, V(G)=P+1
where, P is the no. of predicate nodes contained in the 
flow graph G.