Struct pathfinding::directed::dijkstra::DijkstraReachableItem
source · pub struct DijkstraReachableItem<N, C> {
pub node: N,
pub parent: Option<N>,
pub total_cost: C,
}
Expand description
Information about a node reached by dijkstra_reach
.
Fields§
§node: N
The node that was reached by dijkstra_reach
.
parent: Option<N>
The previous node that the current node came from. If the node is the first node, there will be no parent.
total_cost: C
The total cost from the starting node.
Trait Implementations§
source§impl<N: Clone, C: Clone> Clone for DijkstraReachableItem<N, C>
impl<N: Clone, C: Clone> Clone for DijkstraReachableItem<N, C>
source§fn clone(&self) -> DijkstraReachableItem<N, C>
fn clone(&self) -> DijkstraReachableItem<N, C>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<N: PartialEq, C: PartialEq> PartialEq for DijkstraReachableItem<N, C>
impl<N: PartialEq, C: PartialEq> PartialEq for DijkstraReachableItem<N, C>
source§fn eq(&self, other: &DijkstraReachableItem<N, C>) -> bool
fn eq(&self, other: &DijkstraReachableItem<N, C>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.impl<N: Eq, C: Eq> Eq for DijkstraReachableItem<N, C>
impl<N, C> StructuralPartialEq for DijkstraReachableItem<N, C>
Auto Trait Implementations§
impl<N, C> Freeze for DijkstraReachableItem<N, C>
impl<N, C> RefUnwindSafe for DijkstraReachableItem<N, C>where
N: RefUnwindSafe,
C: RefUnwindSafe,
impl<N, C> Send for DijkstraReachableItem<N, C>
impl<N, C> Sync for DijkstraReachableItem<N, C>
impl<N, C> Unpin for DijkstraReachableItem<N, C>
impl<N, C> UnwindSafe for DijkstraReachableItem<N, C>where
N: UnwindSafe,
C: 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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.