Class DirectedCycle

src/graph/directed/cycle.rs:26–31

The DirectedCycle represents a data type for determining whether a digraph has a directed cycle. The has_cycle operation determines whether the digraph has a simple directed cycle and, if so, the cycle operation returns one. This implementation uses depth-first search.

/// returns one.
/// This implementation uses depth-first search.
pub struct DirectedCycle {
    cycle: Option<Stack<usize>>,
    edge_to: Vec<usize>,
    marked: Vec<bool>,
    on_stack: Vec<bool>,
}

/// The EdgeWeightedDirectedCycle represents a data type for
/// determining whether an edge-weighted digraph has a directed cycle.