Essential complexity
id:
essential-complexity-259-11010630
title:
Essential complexity
text:
Essential complexity is a numerical measure defined by Thomas J. McCabe, Sr., in his highly cited, 1976 paper better known for introducing cyclomatic complexity. McCabe defined essential complexity as the cyclomatic complexity of the reduced CFG after iteratively replacing (reducing) all structured programming control structures, i.e. those having a single entry point and a single exit point with placeholder single statements. McCabe's reduction process is intended to simulate the conceptual rep
brand slug:
wiki
category slug:
encyclopedia
description:
Numerical measure of program structure
original url:
https://en.wikipedia.org/wiki/Essential_complexity
date created:
date modified:
2024-03-05T22:47:01Z
main entity:
{"identifier":"Q5399576","url":"https://www.wikidata.org/entity/Q5399576"}
image:
fields total:
13
integrity:
14