Struct ShortestPath 

pub struct ShortestPath {
    pub vertices: Vec<VertexId>,
    pub edges: Vec<u32>,
}

A single shortest path: the vertex sequence (including from and to) and the edge sequence along it. For a path of k vertices the edge vector has k - 1 entries.

Both vectors are empty when to is unreachable from from, matching upstream (which leaves the output vectors cleared). When from == to the vertex vector is [from] and the edge vector is empty.

Fields

vertices: Vec<VertexId>

Vertex IDs along the path, source first and target last.

edges: Vec<u32>

Edge IDs along the path; vertices.len().saturating_sub(1) long.

Trait Implementations

impl Clone for ShortestPath

fn clone(&self) -> ShortestPath

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ShortestPath

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

Formats the value using the given formatter.

impl PartialEq for ShortestPath

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

impl StructuralPartialEq for ShortestPath