pub fn simple_cycles_in_component(
graph: &Graph<true>,
scc: &[NodeId],
) -> Vec<Vec<NodeId>>Expand description
Returns the simple cycles in a strongly-connected component of a directed graph.
The algorithm implemented comes from “Finding all the elementary circuits of a directed graph” by D. B. Johnson.