diff options
| author | Jarrod Millman <jarrod.millman@gmail.com> | 2017-09-11 15:48:32 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2017-09-11 15:48:32 -0700 |
| commit | be23fa0e422b51f4526828cb19b8105c89e5dcbb (patch) | |
| tree | c11b94af01c1329f6dbe4f69b68b1179862bb9df /networkx/algorithms/approximation/clique.py | |
| parent | ae5acd8ad4fdab34a6b92a381a6ddc78c63a99c0 (diff) | |
| download | networkx-be23fa0e422b51f4526828cb19b8105c89e5dcbb.tar.gz | |
Fix links (#2663)
* Fix links
* Comply with pep8
Diffstat (limited to 'networkx/algorithms/approximation/clique.py')
| -rw-r--r-- | networkx/algorithms/approximation/clique.py | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/networkx/algorithms/approximation/clique.py b/networkx/algorithms/approximation/clique.py index b2789e82..0503f34b 100644 --- a/networkx/algorithms/approximation/clique.py +++ b/networkx/algorithms/approximation/clique.py @@ -9,7 +9,8 @@ Cliques. import networkx as nx from networkx.algorithms.approximation import ramsey __author__ = """Nicholas Mancuso (nick.mancuso@gmail.com)""" -__all__ = ["clique_removal","max_clique"] +__all__ = ["clique_removal", "max_clique"] + def max_clique(G): r"""Find the Maximum Clique @@ -40,7 +41,7 @@ def max_clique(G): vertices in a maximum clique in G. The intersection number of G is the smallest number of cliques that together cover all edges of G. - http://en.wikipedia.org/wiki/Maximum_clique + https://en.wikipedia.org/wiki/Maximum_clique References ---------- @@ -58,6 +59,7 @@ def max_clique(G): iset, _ = clique_removal(cgraph) return iset + def clique_removal(G): """ Repeatedly remove cliques from the graph. |