Struct DijkstraAllPaths 

pub struct DijkstraAllPaths {
    pub vertex_paths: Vec<Vec<Vec<VertexId>>>,
    pub edge_paths: Vec<Vec<Vec<u32>>>,
    pub nrgeo: Vec<u64>,
}

Output of dijkstra_all_shortest_paths.

Fields

vertex_paths: Vec<Vec<Vec<VertexId>>>

vertex_paths[v] = every shortest source→v path as a vertex chain (including source and v). Empty for unreachable v; always [[source]] for v == source.

edge_paths: Vec<Vec<Vec<u32>>>

edge_paths[v] mirrors Self::vertex_paths but with edge ids (length one less than the matching vertex chain). Empty for unreachable v; [[]] for v == source.

nrgeo: Vec<u64>

nrgeo[v] = number of distinct shortest paths from source to v. Zero for unreachable, one for the source itself.

Trait Implementations

impl Clone for DijkstraAllPaths

fn clone(&self) -> DijkstraAllPaths

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DijkstraAllPaths

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

Formats the value using the given formatter.

impl PartialEq for DijkstraAllPaths

fn eq(&self, other: &DijkstraAllPaths) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for DijkstraAllPaths