networkx.algorithms.components.connected.connected_component_subgraphs

networkx.algorithms.components.connected.connected_component_subgraphs(G)

Return connected components as subgraphs.

Parameters :

G : NetworkX Graph

An undirected graph.

Returns :

glist : list

A list of graphs, one for each connected component of G.

See also

connected_components

Notes

The list is ordered from largest connected component to smallest. For undirected graphs only.

Examples

Get largest connected component as subgraph

>>> G=nx.path_graph(4)
>>> G.add_edge(5,6)
>>> H=nx.connected_component_subgraphs(G)[0]