4 votes 4 votes The cyclomatic complexity of a flow graph V(G), in terms of predicate notes is P+1 P-1 P-2 P+2 Where P is the number of predicate nodes in flow graph V(G) IS&Software Engineering ugcnetcse-june2016-paper2 cyclomatic-complexity + – go_editor asked Aug 16, 2016 • edited Jan 10 by makhdoom ghaya go_editor 2.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes V (G) = P + 1 Where P = Number of predicate nodes (node which has degree more than 1 i.e. conditional statemene) A is answer Prashant. answered Aug 16, 2016 • selected Aug 28, 2016 by Prashant. Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.