1.

Cyclometric complexity of a flow graph G with n vertices and e edges is

A. V(G) = e+n-2
B. V(G) = e-n+2
C. V(G) = e+n+2
D. V(G) = e-n-2
Answer» C. V(G) = e+n+2


Discussion

No Comment Found