Struct pathfinding::directed::dijkstra::DijkstraReachableItem

pub struct DijkstraReachableItem<N, C> {
    pub node: N,
    pub parent: Option<N>,
    pub total_cost: C,
}

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

impl<N: Clone, C: Clone> Clone for DijkstraReachableItem<N, C>

fn clone(&self) -> DijkstraReachableItem<N, C>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N: Debug, C: Debug> Debug for DijkstraReachableItem<N, C>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<N: Hash, C: Hash> Hash for DijkstraReachableItem<N, C>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<N: PartialEq, C: PartialEq> PartialEq for DijkstraReachableItem<N, C>

fn eq(&self, other: &DijkstraReachableItem<N, C>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N: Eq, C: Eq> Eq for DijkstraReachableItem<N, C>

impl<N, C> StructuralPartialEq for DijkstraReachableItem<N, C>