Struct graph::walkers::beam::Beam

pub struct Beam<'a, I, N, E, Ty, Ix, F> {
    pub direction: Direction,
    /* private fields */
}

The Beam search strategy implementation

This strategy has a limit of candidate routes at all times. For example, keeps the 3 best routes and all the others get discarded

Fields

direction: Direction

Implementations

impl<'a, I, N, E, Ty: EdgeType, Ix: IndexType, F> Beam<'a, I, N, E, Ty, Ix, F>where F: FnMut(&NodeIndex<Ix>, &NodeIndex<Ix>) -> Ordering,

pub fn new( graph: &'a Graph<I, N, E, Ty, Ix>, journey: (NodeIndex<Ix>, Option<NodeIndex<Ix>>), successors: usize, compare: F, direction: Direction ) -> Self

Trait Implementations

impl<'a, I, N, E, Ty: EdgeType, Ix: IndexType, F> Walker<Ix> for Beam<'a, I, N, E, Ty, Ix, F>where F: FnMut(&NodeIndex<Ix>, &NodeIndex<Ix>) -> Ordering,

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