Struct veloren_common::astar::NodeEntry
source · struct NodeEntry<S> {
came_from: S,
cost: f32,
}
Fields§
§came_from: S
Previous 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: f32
Cost 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> 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