[−][src]Struct cjdns_snode::pathsearch::graph::PathSearchTree

pub struct PathSearchTree<T> {
    pub start_node: T,
    pub paths: Vec<(T, Vec<T>)>,
}

Tree that describes shortest path from a given start node to every other node.

Fields

start_node: T

The starting node in every path.

paths: Vec<(T, Vec<T>)>

Each tuple contains ending node and intermediate nodes as a vector.

Auto Trait Implementations

impl<T> RefUnwindSafe for PathSearchTree<T> where
    T: RefUnwindSafe, 

impl<T> Send for PathSearchTree<T> where
    T: Send, 

impl<T> Sync for PathSearchTree<T> where
    T: Sync, 

impl<T> Unpin for PathSearchTree<T> where
    T: Unpin, 

impl<T> UnwindSafe for PathSearchTree<T> where
    T: UnwindSafe, 

Blanket Implementations

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

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T> Instrument for T[src]

impl<T> Instrument for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

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

The type returned in the event of a conversion error.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>,