Struct ShortestPaths 

pub struct ShortestPaths {
    pub vertices: Vec<Vec<VertexId>>,
    pub edges: Vec<Vec<EdgeId>>,
    pub parents: Vec<VertexId>,
    pub inbound_edges: Vec<EdgeId>,
}

Single-source shortest (or widest) paths towards a set of targets, as returned by Graph::get_shortest_paths and friends.

Fields

vertices: Vec<Vec<VertexId>>

vertices[i] lists the vertices on the path to the i-th target (empty if the target is unreachable).

edges: Vec<Vec<EdgeId>>

edges[i] lists the edges on the path to the i-th target.

parents: Vec<VertexId>

The shortest path tree, indexed by vertex id: the vertex from which each vertex was reached. The source has -1, and vertices not reached during the search have -2 (the search stops as soon as all the targets are reached).

inbound_edges: Vec<EdgeId>

The shortest path tree, indexed by vertex id: the edge through which each vertex was reached; -1 for the source and unreached vertices.

Implementations

impl ShortestPaths

pub fn path(&self, i: usize) -> Option<GraphPath>

The i-th path (towards the i-th target) as a GraphPath.

Trait Implementations

impl Clone for ShortestPaths

fn clone(&self) -> ShortestPaths

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ShortestPaths

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

Formats the value using the given formatter.

impl Default for ShortestPaths

fn default() -> ShortestPaths

Returns the “default value” for a type.

impl Eq for ShortestPaths

impl PartialEq for ShortestPaths

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