The documentation for retworkx has migrated to:
These docs will no longer be updated.
- strongly_connected_components(graph, /)¶
Compute the strongly connected components for a directed graph
This function is implemented using Kosaraju’s algorithm
graph (PyDiGraph) – The input graph to find the strongly connected components for.
A list of list of node ids for strongly connected components
- Return type