engineering recuitment Beltron Programmer Mock Test 2024 Engineering Mathematics Graph Theory Graphs
N is the number of nodes of the control graph and E is the number of edges in the control flow graph. What is Mc Cabe’s cyclomatic complexity V(G)?
1
V(G) = E – N + 2
2
V(G) = E + N + 2
3
V(G) = E + N – 2
4
V(G) = E – N – 2