Struct stack_graphs::cycles::CycleDetector

pub struct CycleDetector<P> { /* fields omitted */ }

Helps detect cycles in the path-finding algorithm.

Implementations

impl<P> CycleDetector<P> where
    P: HasPathKey, 

pub fn new() -> CycleDetector<P>

Creates a new, empty cycle detector.

pub fn should_process_path<F>(&mut self, path: &P, cmp: F) -> bool where
    F: FnMut(&P) -> Ordering, 

Determines whether we should process this path during the path-finding algorithm. If our heuristics decide that this path is a duplicate, or is “non-productive”, then we return false, and the path-finding algorithm will skip this path.