Cyclomatic complexity is a measure of the amount of branching in a function. A higher number of branches gives a higher complexity rating. Higher numbers lead to combinatorial expansion of the 100% c... More

Cyclomatic complexity is a measure of the amount of branching in a function. A higher number of branches gives a higher complexity rating. Higher numbers lead to combinatorial expansion of the 100% coverage testing scenarios required to guarantee the function is bug-free. So high complexity usually means a large chance for bugs. Low complexity means bug-free. This code is written in Perl, but analyzes Python code for complexity by function and class. It also gives statistics about comment density.  [edit]  Less