The Cyclomatic Complexity metric V(G) of the following control flow graph
Cyclomatic complexity is a software metric (measurement), used to indicate the complexity of a program.Cyclomatic complexity is computed using the control flow graph of the program
The complexity M is then defined as
M = E − N + 2P,
But this video from nptel has a different definition. watch at 11:34 sec .
Even this video has same definition..