Struct ShortestPathsDijkstra 

pub struct ShortestPathsDijkstra {
    pub vertex_paths: Vec<Vec<VertexId>>,
    pub edge_paths: Vec<Vec<u32>>,
}

Result of get_shortest_paths_dijkstra: vertex and edge paths from a single source to all vertices.

Fields

vertex_paths: Vec<Vec<VertexId>>

vertex_paths[v] is the vertex sequence of a shortest path from source to v (inclusive at both ends). Empty if v is unreachable.

edge_paths: Vec<Vec<u32>>

edge_paths[v] is the edge-id sequence of a shortest path from source to v. Empty if v is unreachable.

Trait Implementations

impl Clone for ShortestPathsDijkstra

fn clone(&self) -> ShortestPathsDijkstra

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ShortestPathsDijkstra

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

Formats the value using the given formatter.

impl PartialEq for ShortestPathsDijkstra

fn eq(&self, other: &ShortestPathsDijkstra) -> 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 ShortestPathsDijkstra