diff options
| author | Ross Barnowski <rossbar@berkeley.edu> | 2023-05-01 09:38:56 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-05-01 19:38:56 +0300 |
| commit | a896cc0dd72afbb51afcdd5c52263f103bc1e859 (patch) | |
| tree | 77051d926c3d0b29615fcf0bbf690a6c2a96d2b2 | |
| parent | 049794fea380bea1c0a8d35e9a4602ed94a02b30 (diff) | |
| download | networkx-a896cc0dd72afbb51afcdd5c52263f103bc1e859.tar.gz | |
MAINT: minor coverage cleanup. (#6674)
| -rw-r--r-- | networkx/algorithms/approximation/clique.py | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/networkx/algorithms/approximation/clique.py b/networkx/algorithms/approximation/clique.py index cf74c95e..1e462943 100644 --- a/networkx/algorithms/approximation/clique.py +++ b/networkx/algorithms/approximation/clique.py @@ -118,9 +118,6 @@ def max_clique(G): BIT Numerical Mathematics, 32(2), 180–196. Springer. doi:10.1007/BF01994876 """ - if G is None: - raise ValueError("Expected NetworkX graph!") - # finding the maximum clique in a graph is equivalent to finding # the independent set in the complementary graph cgraph = nx.complement(G) |