which one of the following is used to compute cyclomatic complexity?
Which one of the following is used to compute cyclomatic complexity ? E–N+1, where E is the number of flow graph edges and N is the number of flow graph nodes. P–1, where P is the number of predicate nodes in the flow graph G.