pub struct DijkstraResult {
pub distances: FxHashMap<NodeId, f64>,
pub predecessors: FxHashMap<NodeId, NodeId>,
}Expand description
Result of Dijkstra’s algorithm.
Fields§
§distances: FxHashMap<NodeId, f64>Distances from source to each reachable node.
predecessors: FxHashMap<NodeId, NodeId>Predecessor map for path reconstruction.
Implementations§
Trait Implementations§
Source§impl Clone for DijkstraResult
impl Clone for DijkstraResult
Source§fn clone(&self) -> DijkstraResult
fn clone(&self) -> DijkstraResult
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for DijkstraResult
impl RefUnwindSafe for DijkstraResult
impl Send for DijkstraResult
impl Sync for DijkstraResult
impl Unpin for DijkstraResult
impl UnwindSafe for DijkstraResult
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