Software-Engineering

With respect to software testing, consider a flow graph G with one connected component. Let E be the number of edges, N be the number of nodes, and P be the number of predicate nodes of G. Consider the following four expressions:
1. E – N + P
2. E – N + 2
3. P + 2
4. P + 1
The cyclomatic complexity of G is given by