McCabe's cyclomatic complexity number of a program control graph $\text{'}G\text{'}$ with e edges, $n$ nodes and $p$ disconnected paths is defined as

$($a$)n-e+2p$

$($b$)e-n+2+p$

$($c$)e-n+2p$

$($d$)n-e+p,$