Struct graph::walkers::bidirectional::Bidirectional

pub struct Bidirectional<'a, I, N, E, Ty, Ix, M1, M2> { /* private fields */ }

The Bidirectional strategy. Performs the seach operation with two (may be different) state machines

Rules: Each machine needs to be totally opposite to the other one. Thus:

• The target node of the a machine m1 needs to be the starting node of the machine m2
• The starting node of the a walker m1 needs to be the target node of a machine m2
• The direction of the walker m1 needs to be petgraph::Outgoing and the m2 must be petgraph::Incoming

Implementations

impl<'a, I, N, E, Ty: EdgeType, Ix: IndexType, M1, M2> Bidirectional<'a, I, N, E, Ty, Ix, M1, M2>where M1: Walker<Ix>, M2: Walker<Ix>,

pub fn new( graph: &'a Graph<I, N, E, Ty, Ix>, machine_a: M1, machine_b: M2 ) -> Self

Trait Implementations

impl<'a, I, N, E, Ty: EdgeType, Ix: IndexType, M1, M2> Walker<Ix> for Bidirectional<'a, I, N, E, Ty, Ix, M1, M2>where M1: Walker<Ix>, M2: Walker<Ix>,

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