pub struct Node<N: Clone + Eq + Hash> {
pub state: N,
pub parent: Option<Rc<Node<N>>>,
pub g: f64,
pub h: f64,
}Expand description
A node in the search graph
Fields§
§state: NThe state represented by this node
parent: Option<Rc<Node<N>>>The parent node
g: f64The cost from the start node to this node (g-value)
h: f64The estimated cost from this node to the goal (h-value)
Implementations§
Trait Implementations§
Source§impl<N: Clone + Eq + Hash> Ord for Node<N>
impl<N: Clone + Eq + Hash> Ord for Node<N>
Source§impl<N: Clone + Eq + Hash> PartialOrd for Node<N>
impl<N: Clone + Eq + Hash> PartialOrd for Node<N>
impl<N: Clone + Eq + Hash> Eq for Node<N>
Auto Trait Implementations§
impl<N> Freeze for Node<N>where
N: Freeze,
impl<N> RefUnwindSafe for Node<N>where
N: RefUnwindSafe,
impl<N> !Send for Node<N>
impl<N> !Sync for Node<N>
impl<N> Unpin for Node<N>where
N: Unpin,
impl<N> UnwindSafe for Node<N>where
N: UnwindSafe + RefUnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.