petgraph::algo::dijkstra

Struct AlgoResult

Source 
pub struct AlgoResult<N, K> {
    pub scores: HashMap<N, K>,
    pub goal_node: Option<N>,
}
Expand description

Return value of with_dynamic_goal.

Fields§

§scores: HashMap<N, K>

A hashbrown::HashMap that maps NodeId to path cost.

§goal_node: Option<N>

The goal node that terminated the search, if any was found.

Auto Trait Implementations§

§

impl<N, K> Freeze for AlgoResult<N, K>
where N: Freeze,

§

impl<N, K> RefUnwindSafe for AlgoResult<N, K>
where N: RefUnwindSafe, K: RefUnwindSafe,

§

impl<N, K> Send for AlgoResult<N, K>
where N: Send, K: Send,

§

impl<N, K> Sync for AlgoResult<N, K>
where N: Sync, K: Sync,

§

impl<N, K> Unpin for AlgoResult<N, K>
where N: Unpin, K: Unpin,

§

impl<N, K> UnwindSafe for AlgoResult<N, K>
where N: UnwindSafe, K: UnwindSafe,

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.