Cyclomatic complexity
Cyclomatic complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's source code. It was developed by Thomas J. McCabe, Sr. in 1976.
From Wikipedia, the free encyclopedia Cyclomatic complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's source code. It was developed by Thomas J. McCabe, Sr. in 1976. Cyclomatic complexity is computed using the control-flow graph of the program. The nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command. Cyclomatic complexity may also be…
saved by
related reading
- Shtetl-Optimized >> Blog Archive >> The First Law of Complexodynamicsscottaaronson.blog
- https://danluu.comdanluu.com
- UI Skills for Design Engineers | UI Skillsui-skills.com
- Agentationagentation.dev
- Out of the Tar Pitcurtclifton.net
- GitHub - ByteByteGoHq/system-design-101: Explain complex systems using visuals and simple terms. Help you prepare for system design interviews. · GitHubgithub.com
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Google Testing Blog: Code Healthtesting.googleblog.com
- Code coverage - Wikipediaen.wikipedia.org
- Agentationagentation.com
- Coding Speed Testcodingspeedtest.com
- Rams Skill · Free Design Review for Claude Code, Cursor & Codexrams.ai