Cyclomatic Complexity in Code
summary
Measures software architecture using operational, structural and process metrics and focuses on cyclomatic complexity as a structural measure. Presents concrete formulas CC = E - N + 2P and the common shortcut p + 1 and shows counting edges/nodes or predicate lines to derive the number of unit tests. Demonstrates flow‑graph examples, handling statistical outliers for performance data, averaging method for class complexity, and gives practical thresholds like 1–10 good, 10–20 warning, 20–40 high, >40 untestable.
AI-written summary · about
chapters (11)
- 0:00Measuring architecture characteristics
- 3:40Defining architecture characteristics
- 7:35Operational measures and analysis
- 12:34Cyclomatic complexity introduction
- 15:26Calculating cyclomatic complexity
- 20:30Simplified calculations
- 23:20Counting predicates
- 25:29Practical examples
- 29:27Interpreting complexity values
- 31:56Process measures
- 33:20Summary of methods
related talks
14mCyclomatic Complexity for Developers
44mTesting Software Architecture
47mComplexity is a Sin
49mMetrics for Architects
40mTesting Software Architecture
33mPractical Applications of Complexity in Software & Digital Products Development
01h 21mEmpirically Measuring, & Reducing, C++’s Accidental Complexity
35m"You Can't Miss What You Can't Measure"