cyclomatic complexity

Not Reviewed
Equation / Last modified by mike on 2015/07/29 07:05
`"Complexity"_"cyclomatic" = `
MichaelBartmess.cyclomatic complexity

This estimation technique is used to compute the complexity of a program, algorithm, function, module, method, or class by computing the number of linearly independent paths through the code. The computation of the cyclomatic complexity is abstracted from the control flow graph of the program. The nodes of the graph correspond to functionally indivisible code blocks and edges connect two nodes when successive blocks must execute one after the other.