Trait astar::ReusableSearchProblem

pub trait ReusableSearchProblem {
    type Node: Hash + PartialEq + Eq + Clone;
    type Cost: PartialOrd + Zero + Clone;
    type Iter: Iterator<Item = (Self::Node, Self::Cost)>;
    fn heuristic(&self, _: &Self::Node, _: &Self::Node) -> Self::Cost;
    fn neighbors(&mut self, _: &Self::Node) -> Self::Iter;

    fn estimate_length(&self, _a: &Self::Node, _b: &Self::Node) -> Option<u32> { ... }
    fn search(
        &mut self, 
        start: Self::Node, 
        end: Self::Node
    ) -> ReuseSearchInstance<Self, Self::Node> { ... }
}

Associated Types

type Node: Hash + PartialEq + Eq + Clone

type Cost: PartialOrd + Zero + Clone

type Iter: Iterator<Item = (Self::Node, Self::Cost)>

Required Methods

fn heuristic(&self, _: &Self::Node, _: &Self::Node) -> Self::Cost

fn neighbors(&mut self, _: &Self::Node) -> Self::Iter

Provided Methods

fn estimate_length(&self, _a: &Self::Node, _b: &Self::Node) -> Option<u32>

fn search(
    &mut self,
    start: Self::Node,
    end: Self::Node
) -> ReuseSearchInstance<Self, Self::Node>

Implementors

• impl<T: TwoDSearchProblem> ReusableSearchProblem for T