Struct AllPairsResult 

pub struct AllPairsResult {
    pub distances: HashMap<NodeId, HashMap<NodeId, f64>>,
    pub next_hop: HashMap<NodeId, HashMap<NodeId, Option<NodeId>>>,
    pub node_order: Vec<NodeId>,
}

All-pairs shortest paths result

Fields

distances: HashMap<NodeId, HashMap<NodeId, f64>>

Distance matrix: dist[i][j] = shortest distance from node i to node j

next_hop: HashMap<NodeId, HashMap<NodeId, Option<NodeId>>>

Next-hop matrix for path reconstruction: next[i][j] = next node on shortest path from i to j

node_order: Vec<NodeId>

Node ordering for matrix access

Implementations

impl AllPairsResult

pub fn distance(&self, from: NodeId, to: NodeId) -> f64

Get the shortest distance between two nodes

pub fn path(&self, from: NodeId, to: NodeId) -> Option<Vec<NodeId>>

Reconstruct the shortest path between two nodes

Trait Implementations

impl Clone for AllPairsResult

fn clone(&self) -> AllPairsResult

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AllPairsResult

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.