| commit | fa46c60642cf3bec35824c2608a2368765bee38d | [log] [tgz] |
|---|---|---|
| author | Tushar Sadhwani <86737547+tushar-deepsource@users.noreply.github.com> | Mon Jun 19 13:25:28 2023 +0530 |
| committer | GitHub <noreply@github.com> | Mon Jun 19 13:25:28 2023 +0530 |
| tree | 2d9d8288e9c81d8ccbd60a1557d856f545f4e14c | |
| parent | 12a327be44b017b5208ef96e171f894e4d7e318c [diff] |
fix: formula for mccabe complexity in docstring
diff --git a/mccabe.py b/mccabe.py index 302ac6d..cc10d7c 100644 --- a/mccabe.py +++ b/mccabe.py
@@ -84,7 +84,7 @@ def complexity(self): """ Return the McCabe complexity for the graph. - V-E+2 + E-V+2 """ num_edges = sum([len(n) for n in self.nodes.values()]) num_nodes = len(self.nodes)