Struct astar::ReuseSearchInstance

pub struct ReuseSearchInstance<'a, RSP: 'a + ?Sized, S> { /* fields omitted */ }

Trait Implementations

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

type Node = RSP::Node

type Cost = RSP::Cost

type Iter = RSP::Iter

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

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

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

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

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