Question { ISTQB, 8824 }

What is cyclomatic complexity?

Answer

Hi,
Cyclomatic complexcity is a methodology to measure the
complexity at a certain area of code.In other words it an
another way to reach at defect clustering.
Cyclomatic complexity is to measure the number of
independent paths in a program's source code.
The formula it follow: M = E- N + 2P
where

M = cyclomatic complexity
E = number of edges of the graph
N = number of nodes of the graph
P = the number of connected components.

**The easier one is like:n(umber of Decision statements in
the program being tested plus one.)
It provides the degree of testing/review required in a
certain area of code.