diff options
| author | Jeffrey Finkelstein <jeffrey.finkelstein@gmail.com> | 2015-12-17 10:30:12 -0500 |
|---|---|---|
| committer | Jeffrey Finkelstein <jeffrey.finkelstein@gmail.com> | 2015-12-17 10:30:12 -0500 |
| commit | 98e84343c2bd10862014e73c3a7208f7f06475f0 (patch) | |
| tree | d129f115e0350560115c72c354a4556d287f5aec /networkx/algorithms/approximation/clique.py | |
| parent | 226a7ac86932772265a4d2d1d936bcb49d85fb29 (diff) | |
| download | networkx-98e84343c2bd10862014e73c3a7208f7f06475f0.tar.gz | |
Allows copying a graph without attribute data.
Adds the `with_data` keyword argument to the `Graph.copy()` method,
which specifies whether the graph, node, and edge data will be included
in the copy of the graph object.
This commit also updates algorithms that include a call to
`Graph.copy()` to use `with_data=False` if they really do not need a
copy of the data.
Diffstat (limited to 'networkx/algorithms/approximation/clique.py')
| -rw-r--r-- | networkx/algorithms/approximation/clique.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/networkx/algorithms/approximation/clique.py b/networkx/algorithms/approximation/clique.py index ff6d7573..f3f07374 100644 --- a/networkx/algorithms/approximation/clique.py +++ b/networkx/algorithms/approximation/clique.py @@ -81,7 +81,7 @@ def clique_removal(G): Approximating maximum independent sets by excluding subgraphs. BIT Numerical Mathematics, 32(2), 180–196. Springer. """ - graph = G.copy() + graph = G.copy(with_data=False) c_i, i_i = ramsey.ramsey_R2(graph) cliques = [c_i] isets = [i_i] |