pub struct LazyShortestPaths<W> { /* private fields */ }Expand description
A struct representing the intermediate output of Dijkstra’s algorithm.
Implementations§
Source§impl<W> LazyShortestPaths<W>
impl<W> LazyShortestPaths<W>
Sourcepub fn get(&self, node_index: usize) -> ShortestPath<W>
pub fn get(&self, node_index: usize) -> ShortestPath<W>
Returns the shortest path for a given node.
Sourcepub fn get_all(&self) -> Vec<ShortestPath<W>>
pub fn get_all(&self) -> Vec<ShortestPath<W>>
Returns the shortest paths for all nodes.
Trait Implementations§
Auto Trait Implementations§
impl<W> Freeze for LazyShortestPaths<W>
impl<W> RefUnwindSafe for LazyShortestPaths<W>where
W: RefUnwindSafe,
impl<W> Send for LazyShortestPaths<W>where
W: Send,
impl<W> Sync for LazyShortestPaths<W>where
W: Sync,
impl<W> Unpin for LazyShortestPaths<W>where
W: Unpin,
impl<W> UnwindSafe for LazyShortestPaths<W>where
W: 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