Function retworkx::strongly_connected_components

pub fn strongly_connected_components(graph: &PyDiGraph) -> Vec<Vec<usize>>

Compute the strongly connected components for a directed graph

This function is implemented using Kosaraju’s algorithm

:param PyDiGraph graph: The input graph to find the strongly connected components for.

:return: A list of list of node ids for strongly connected components :rtype: list