Cyclomatic complexity
id:
cyclomatic-complexity-166-6883493
title:
Cyclomatic complexity
text:
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 correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately af
brand slug:
wiki
category slug:
encyclopedia
description:
Measure of the structural complexity of a software program
original url:
https://en.wikipedia.org/wiki/Cyclomatic_complexity
date created:
2004-09-24T21:34:53Z
date modified:
2024-08-29T20:16:22Z
main entity:
{"identifier":"Q867330","url":"https://www.wikidata.org/entity/Q867330"}
image:
fields total:
13
integrity:
15