Class | Roodi::Checks::CyclomaticComplexityCheck |
In: |
lib/roodi/checks/cyclomatic_complexity_check.rb
|
Parent: | Check |
Cyclomatic complexity counts the number of linearly independent paths in the code. The lower the score, the better.
Read more in the inventor Thomas J. McCabe‘s original research paper: www.literateprogramming.com/mccabe.pdf
COMPLEXITY_NODE_TYPES | = | [:if, :while, :until, :for, :rescue, :case, :when, :and, :or] |
complexity | [RW] |