Content deleted Content added
Citation bot (talk | contribs) m Alter: title. Add: chapter-url. Removed parameters. | You can use this bot yourself. Report bugs here. | User-activated. |
mNo edit summary |
||
Line 1:
'''Cyclomatic complexity''' is a [[software metric]] used to indicate the [[Programming complexity|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.
Line 180:
==See also==
* [[
* [[Complexity trap]]
* [[Computer program]]
| |||