Which one of the following statements is incorrect?
1
The number of regions corresponds to the cyclomatic complexity.
2
Cyclomatic complexity for a flow graph G is V(G) = N - E + 2, where E is the number of edges and N is the number of nodes in flow graph.
3
Cyclomatic complexity for a flow graph G is V(G) = E - N + 2, where E is the number of edges and N is the number of nodes in flow graph.
4
Cyclomatic complexity for a flow graph G is V(G) = P + 1, where P is the number of predicate nodes contained in the flow graph G.