networkx.strongly_connected_component_subgraphs
networkx.kosaraju_strongly_connected_components
Enter search terms or a module, class or function name.
Returns list of strongly connected components in G.
Uses Tarjan’s algorithm with Nuutila’s modifications. this recursive version of the algorithm will hit the Python stack limit for large graphs.