From a896cc0dd72afbb51afcdd5c52263f103bc1e859 Mon Sep 17 00:00:00 2001 From: Ross Barnowski Date: Mon, 1 May 2023 09:38:56 -0700 Subject: MAINT: minor coverage cleanup. (#6674) --- networkx/algorithms/approximation/clique.py | 3 --- 1 file changed, 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) -- cgit v1.2.1