networkx.algorithms.components.strongly_connected.strongly_connected_component_subgraphs

strongly_connected_component_subgraphs(G)

Return strongly connected components as subgraphs.

Parameters:

G : NetworkX Graph

A graph.

Returns:

glist : list

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

See also

connected_component_subgraphs

Notes

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