Cyclomatic complexity: Difference between revisions

Revision as of 12:16, 23 November 2022

Revision as of 08:44, 28 December 2022

Line 1:

{{Short description|Measure of the structural complexity of a software program}}

{{Cleanup bare URLs|date=September 2022}}

'''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.

Line 93 ⟶ 92:

=== Interpretation ===

In his presentation 'Software Quality Metrics to Identify Risk'<ref>{{cite web |url=http://www.mccabe.com/ppt/SoftwareQualityMetricsToIdentifyRisk.ppt |title=Software Quality Metrics to Identify Risk |author=Thomas McCabe Jr. |year=2008 |archive-url=https://web.archive.org/web/20220329072759/http://www.mccabe.com/ppt/SoftwareQualityMetricsToIdentifyRisk.ppt |archive-date=2022-03-29 |url-status=live}}</ref> for the Department of Homeland Security, Tom McCabe introduces the following categorisation to interpret cyclomatic complexity:

* 1 - 10 Simple procedure, little risk