Trait Walker

pub trait Walker<S, Ix = DefaultIx> {
    // Required method
    fn step(&mut self) -> WalkerState<S, Ix>;
}

Required Methods

fn step(&mut self) -> WalkerState<S, Ix>

Implementors

impl<'a, D, I, N, E, Ty: EdgeType, Ix: IndexType> Walker<D, Ix> for DepthFirst<'a, D, I, N, E, Ty, Ix>

where D: Measure + Copy + One + Zero,

impl<'a, F, K, I, N, E, Ty: EdgeType, Ix: IndexType> Walker<K, Ix> for Dijkstra<'a, F, K, I, N, E, Ty, Ix>

where K: Measure + Copy + Ord, F: FnMut(&E) -> K, EdgeIndex: From<EdgeIndex<Ix>>,

impl<'a, I, N, E, Ty: EdgeType, Ix: IndexType> Walker<(), Ix> for BreadthFirst<'a, I, N, E, Ty, Ix>