diff options
| author | Jarrod Millman <jarrod.millman@gmail.com> | 2018-01-19 15:11:00 -0800 |
|---|---|---|
| committer | Jarrod Millman <jarrod.millman@gmail.com> | 2018-01-20 01:27:28 -0800 |
| commit | 7e63811866e86e87e244790b5310098737c22ec4 (patch) | |
| tree | b8f6c3c711f72e7dd0b96312116c1ebba0899ad7 /networkx/algorithms/mis.py | |
| parent | ea3a8826385f543775e2c6b147cbffcd289527da (diff) | |
| download | networkx-7e63811866e86e87e244790b5310098737c22ec4.tar.gz | |
Pep8 fixes
Diffstat (limited to 'networkx/algorithms/mis.py')
| -rw-r--r-- | networkx/algorithms/mis.py | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/networkx/algorithms/mis.py b/networkx/algorithms/mis.py index ad48a537..7811e745 100644 --- a/networkx/algorithms/mis.py +++ b/networkx/algorithms/mis.py @@ -71,11 +71,11 @@ def maximal_independent_set(G, nodes=None): nodes = set(nodes) if not nodes.issubset(G): raise nx.NetworkXUnfeasible( - "%s is not a subset of the nodes of G" % nodes) + "%s is not a subset of the nodes of G" % nodes) neighbors = set.union(*[set(G.adj[v]) for v in nodes]) if set.intersection(neighbors, nodes): raise nx.NetworkXUnfeasible( - "%s is not an independent set of G" % nodes) + "%s is not an independent set of G" % nodes) indep_nodes = list(nodes) available_nodes = set(G.nodes()).difference(neighbors.union(nodes)) while available_nodes: |