Cyclomatic Complexity for Developers
summary
Explains cyclomatic complexity as the exact measure from a control‑flow graph using M = E − N + 2 applied to individual Java methods, and shows how switches, loops and boolean operators (&&/||) each increment the count so a single long method can reach the common threshold of around 10. Demonstrates computing complexity with SonarQube to locate hotspots, gives concrete Java examples of switch‑heavy and boolean‑dense methods, and notes that some high complexity scores are unavoidable while others can be reduced by refactoring.
AI-written summary · about
chapters (12)
- 0:00Welcome
- 0:49Cyclomatic complexity
- 1:56Calculating complexity
- 3:19Branching impact
- 4:47Complexity example
- 6:24Nested structures
- 7:54Boolean conditions
- 9:06Simplifying code
- 10:23Unmanageable complexity
- 11:28Code review metrics
- 12:55Complexity analysis
- 13:15Q&A
