You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository was archived by the owner on Aug 17, 2026. It is now read-only.
I'd like to add cyclomatic complexity as an additional heuristic in the Python analyzer.
Right now the current analyzer already considers structural metrics such as:
AST depth
Loop count
Try/except count
Function length variance
Nested function depth
Cyclomatic complexity is another widely used software engineering metric that measures the number of independent execution paths through code. It can provide additional information about the structural complexity of a code sample and may improve the detector's overall signal when combined with existing heuristics.
I would implement it by:
Computing cyclomatic complexity by traversing the Python AST.
I'd like to add cyclomatic complexity as an additional heuristic in the Python analyzer.
Right now the current analyzer already considers structural metrics such as:
Cyclomatic complexity is another widely used software engineering metric that measures the number of independent execution paths through code. It can provide additional information about the structural complexity of a code sample and may improve the detector's overall signal when combined with existing heuristics.
I would implement it by:
I would add these features
Would this be a helpful feature?