pub fn strongly_connected_components<N, FN, IN>(
    nodes: &[N],
    successors: FN
) -> Vec<Vec<N>>
where N: Clone + Hash + Eq, FN: FnMut(&N) -> IN, IN: IntoIterator<Item = N>,
Expand description

Partition all strongly connected components in a graph.

  • nodes is a collection of nodes.
  • successors returns a list of successors for a given node.

The function returns a list of strongly connected components sets.