Revision as of 10:07, 12 January 2019 edit 37.132.194.166 (talk) I changed the final equation in the description of the second figure, from 10-8+1=3, to 10-8+2=4, because, it says that it's using equation [3], but equation [3] say that the formula has a +2, not a +1, so the result changes. Tag: Visual edit ← Previous edit		Revision as of 17:05, 25 January 2019 edit undo 136.24.12.110 (talk) Removed unnecessary comma Next edit →
Line 1: '''Cyclomatic complexity''' is a [[software metric]], used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's [[source code]]. It was developed by [[Thomas J. McCabe, Sr.]] in 1976. Cyclomatic complexity is computed using the [[control flow graph]] of the program: the nodes of the [[Graph (discrete mathematics)\|graph]] correspond to indivisible groups of commands of a program, and a [[Directed graph\|directed]] edge connects two nodes if the second command might be executed immediately after the first command. Cyclomatic complexity may also be applied to individual [[function (computer science)\|functions]], [[modular programming\|modules]], [[method (computer science)\|methods]] or [[class (computer science)\|classes]] within a program.

Cyclomatic complexity: Difference between revisions