Answer : Cyclomatic complexity for a flow graph G is V(G)=E-N+2, where E is the number of edges and N is the number of nodes in flow graph.
Cyclomatic complexity is a software metric (measurement), used to indicate the complexity of a program
Cyclomatic complexity = E - N + P
where,
E = number of edges in the flow graph.
N = number of nodes in the flow graph.
P = number of nodes that have exit points
Reference : Cyclomatic Complexity