pub fn simple_cycles_in_component<N>(
graph: &Graph<true, N>,
scc: &[N],
) -> Vec<Vec<N>>where
N: GraphNodeId,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.