Generate connected components as subgraphs.
- G (NetworkX graph) – An undirected graph.
- copy (bool (default=True)) – If True make a copy of the graph attributes
comp – A generator of graphs, one for each connected component of G.
NetworkXNotImplemented: – If G is undirected.
>>> G = nx.path_graph(4) >>> G.add_edge(5,6) >>> graphs = list(nx.connected_component_subgraphs(G))
If you only want the largest connected component, it’s more efficient to use max instead of sort:
>>> Gc = max(nx.connected_component_subgraphs(G), key=len)
For undirected graphs only. Graph, node, and edge attributes are copied to the subgraphs by default.