Wednesday 27 May 2015

Q5,paper 2,J 13.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 B.
Posted by at

No comments:

Post a Comment

Note: only a member of this blog may post a comment.

Subscribe to: Post Comments (Atom)