4 4 votes The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes, isP+1 P-1 P-2 P+2Where P is the number of predicate nodes in flow graph V(G) IS&Software Engineering ugcnetcse-july2016-paper2 cyclomatic-complexity + – go_editor 3.0k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 3 3 votes V (G) = P + 1Where P = Number of predicate nodes (node which has degree more than 1 i.e. conditional statemene)A is answer Prashant. answered Aug 16, 2016 • edited Aug 11, 2025 by GO Classes Prashant. comment Share Follow 0 reply Please log in or register to add a comment.