Cyclomatic Complexity

Cyclomatic Complexity

It is a number of independent paths in a program.

Cyclomatic complexity is defined as: L-N+2P, where L is a number of a graph edges / connections; N is a number of nodes of a graph; P is a number of unrelated parts of a graph. For example, a call graph and a sub-program.

Knowledge Center
Knowledge Center
Subscribe

*- required fields