|
432 | 432 | lazy_import('sage.graphs.mcqd', ['mcqd'],
|
433 | 433 | feature=PythonModule('sage.graphs.mcqd', spkg='mcqd'))
|
434 | 434 |
|
435 |
| -from sage.misc.decorators import rename_keyword |
436 |
| - |
437 | 435 |
|
438 | 436 | class Graph(GenericGraph):
|
439 | 437 | r"""
|
@@ -6904,7 +6902,6 @@ def cliques_get_clique_bipartite(self, **kwds):
|
6904 | 6902 | return BipartiteGraph(networkx.make_clique_bipartite(self.networkx_graph(), **kwds))
|
6905 | 6903 |
|
6906 | 6904 | @doc_index("Algorithmically hard stuff")
|
6907 |
| - @rename_keyword(deprecation=32238, verbosity='verbose') |
6908 | 6905 | def independent_set(self, algorithm="Cliquer", value_only=False, reduction_rules=True,
|
6909 | 6906 | solver=None, verbose=0, *, integrality_tolerance=1e-3):
|
6910 | 6907 | r"""
|
@@ -6999,7 +6996,6 @@ def independent_set(self, algorithm="Cliquer", value_only=False, reduction_rules
|
6999 | 6996 | return [u for u in self if u not in my_cover]
|
7000 | 6997 |
|
7001 | 6998 | @doc_index("Algorithmically hard stuff")
|
7002 |
| - @rename_keyword(deprecation=32238, verbosity='verbose') |
7003 | 6999 | def vertex_cover(self, algorithm="Cliquer", value_only=False,
|
7004 | 7000 | reduction_rules=True, solver=None, verbose=0,
|
7005 | 7001 | *, integrality_tolerance=1e-3):
|
|
0 commit comments