summaryrefslogtreecommitdiff
path: root/networkx/algorithms/approximation/clique.py
diff options
context:
space:
mode:
Diffstat (limited to 'networkx/algorithms/approximation/clique.py')
-rw-r--r--networkx/algorithms/approximation/clique.py3
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)