Trait astar::SearchProblem

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

    fn estimate_length(&self) -> Option<u32> { ... }
}

Associated Types

type Node: Hash + PartialEq + Eq

type Cost: PartialOrd + Zero + Clone

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

Required Methods

fn start(&self) -> Self::Node

fn is_end(&self, _: &Self::Node) -> bool

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

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

Provided Methods

fn estimate_length(&self) -> Option<u32>

Implementors

• impl<'a, RSP: ReusableSearchProblem> SearchProblem for ReuseSearchInstance<'a, RSP, RSP::Node>