DijkstraResult

graph::prelude::dijkstra

Struct DijkstraResult 

Source 
pub struct DijkstraResult {
    pub distances: HashMap<NodeId, f64>,
    pub parents: HashMap<NodeId, NodeId>,
}
Expand description

Result of a Dijkstra shortest-path search from one source node.

Contains shortest distances from the source and the parent map needed to reconstruct any shortest path via reconstruct_path.

Fields§

§distances: HashMap<NodeId, f64>

Map from NodeId to the shortest distance from the source.

Only nodes reachable from the source have an entry. Unreachable nodes are absent (not f64::INFINITY).

§parents: HashMap<NodeId, NodeId>

Parent of each node in the shortest-path tree.

Follow parents[v] → parents[parents[v]] → … → source to recover the shortest path. The source itself has no parent entry.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.