Note on Cyclomatic Complexity - IBM Documentation via ibm.com
Cyclomatic complexity is a measurement developed by Thomas McCabe to determine the stability and level of confidence in a program. It measures the number of linearly-independent paths through a program module. Programs with lower Cyclomatic complexity are easier to understand and less risky to modify.
Ruby has a linter you can use to guard against this.
I have liked monitoring this, but other developers don’t like it.
Reference
- Notes
- metrics, software-engineering
- Cyclomatic Complexity - IBM Documentation
-
Permalink to
2024.NTE.063 - Edit
| ← Previous | Next → |
| Note on Behind F1's Velvet Curtain via Kate Wagner | Note on Simon Wardley - X Marks the Spot via SEACOM Global |