struct NodeEntry<S> {
came_from: S,
cost: f32,
}Fields§
§came_from: SPrevious node in the cheapest path (known so far) that goes from the start to this node.
If came_from == self this is the start node! (to avoid inflating the
size with Option)
cost: f32Cost to reach this node from the start by following the cheapest path known so far. This is the sum of the transition costs between all the nodes on this path.
Trait Implementations§
Auto Trait Implementations§
impl<S> Freeze for NodeEntry<S>where
S: Freeze,
impl<S> RefUnwindSafe for NodeEntry<S>where
S: RefUnwindSafe,
impl<S> Send for NodeEntry<S>where
S: Send,
impl<S> Sync for NodeEntry<S>where
S: Sync,
impl<S> Unpin for NodeEntry<S>where
S: Unpin,
impl<S> UnwindSafe for NodeEntry<S>where
S: UnwindSafe,
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,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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 more