The cyclomatic complexity equation V(G)= +1 is applicable only if every predicate node has: (a) Two outgoing
Question:
The cyclomatic complexity equation V(G)= +1 is applicable only if every predicate node has:
(a) Two outgoing edges
(b) Three or more outgoing edges
(c) No outgoing edge
(d) One outgoing edge
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Flexible, Reliable Software Using Patterns And Agile Development
ISBN: 9781439882726
1st Edition
Authors: Henrik B Christensen
Question Posted: