pub fn strongly_connected_components<N, W>(
graph: &Graph<N, W>,
) -> Result<Vec<Vec<usize>>, GraphError>Expand description
Strongly connected components via iterative Tarjan, respecting edge direction. Each component is sorted; components are ordered by smallest member. (For undirected graphs this coincides with connected components.)