Everything About ___
Live briefing

Everything about Essential complexity

Numerical measure of program structure

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. Wikipedia →

đź§­ Start here: a 6-step reading path

  1. Read the overview: Essential complexityA 5-minute orientation
  2. Skim a recent paper: Comparative Discrimination of Life’s Simple 7 and Life’s Essential 8 to Stratify Cardiovascular Risk: Is the Added Complexity Worth It?Influential work since 2022
  3. Pick up a classic book: People First SocietyThe most-reprinted book on the subject
  4. Read the landmark paper: Effect of chemical complexity of essential oils on feeding deterrence in larvae of the cabbage looperCited 90 times
  5. Go sideways: Structured program theoremA closely related topic
  6. Go sideways: Cyclomatic complexityA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

No outline available.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics