networkx.algorithms.components.strongly_connected.strongly_connected_components
networkx.algorithms.components.strongly_connected.strongly_connected_components_recursive
Enter search terms or a module, class or function name.
Return strongly connected components as subgraphs.
G : NetworkX Graph
A graph.
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 strongly connected component to smallest.