diff options
| author | Dan Schult <dschult@colgate.edu> | 2019-10-10 10:16:26 -0400 |
|---|---|---|
| committer | Jarrod Millman <jarrod.millman@gmail.com> | 2019-10-12 09:26:31 -0700 |
| commit | cff8cfdd398d17c80ac21b2515414d7b4c9c200b (patch) | |
| tree | 1b4c9b97bb7dd8a88e8cee04529a8f56d6af922f /examples/algorithms | |
| parent | 777005b337ec177d121c2a4118e9fc9088e03202 (diff) | |
| download | networkx-cff8cfdd398d17c80ac21b2515414d7b4c9c200b.tar.gz | |
Remove deprecated from examples
Diffstat (limited to 'examples/algorithms')
| -rw-r--r-- | examples/algorithms/plot_blockmodel.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/examples/algorithms/plot_blockmodel.py b/examples/algorithms/plot_blockmodel.py index 114ee3f6..0fa3a00b 100644 --- a/examples/algorithms/plot_blockmodel.py +++ b/examples/algorithms/plot_blockmodel.py @@ -56,7 +56,7 @@ if __name__ == '__main__': G = nx.read_edgelist("hartford_drug.edgelist") # Extract largest connected component into graph H - H = next(nx.connected_component_subgraphs(G)) + H = G.subgraph(next(nx.connected_components(G))) # Makes life easier to have consecutively labeled integer nodes H = nx.convert_node_labels_to_integers(H) # Create parititions with hierarchical clustering |