Repository navigation

ENH: Add cyclomaticComplexity calculation tool #8

Closed

Labels

opened

on Aug 17, 2025

Calculate the cyclomatic complexity using the formula M=E-N+2P, where
E = number of edges in the control-flow graph
N = number of nodes in the control-flow graph
P = number of connected components (usually P=1 for a single function)

Shashankss1205
added
enhancementNew feature or request
on Aug 17, 2025
Shashankss1205
closed this as completed on Aug 17, 2025
kirovcaptain
added a commit that references this issue on Mar 27, 2026
feat: optimize indexing - COALESCE merge (CodeGraphContext#9), CREATE…
2dc9466
DmytroTelish
added 2 commits that reference this issue on May 27, 2026
test(upgrade): replace held-dict mutation with list append
0bf6f3d
docs(upgrade): mark follow-ups #2, CodeGraphContext#6, CodeGraphConte…
67817b8
DmytroTelish
added 2 commits that reference this issue on Jul 6, 2026
test(upgrade): replace held-dict mutation with list append
8552594
docs(upgrade): mark follow-ups #2, CodeGraphContext#6, CodeGraphConte…
61e9073

to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Assignees

No one assigned

Labels

Type

No type

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests