retagged by
462 views

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Ramayya asked Jan 7
254 views
McCabe’s cyclomatic complexity number of a program control graph ‘$G$’ with $e$edges, $n$ nodes and $p$ disconnected paths is defined as$n – e + 2p$$e – n + 2 +...