Struct AllShortestPaths 

pub struct AllShortestPaths {
    pub vertices: Vec<Vec<VertexId>>,
    pub edges: Vec<Vec<EdgeId>>,
    pub nrgeo: Vec<i64>,
}

All the shortest paths from one source, as returned by Graph::get_all_shortest_paths.

Fields

vertices: Vec<Vec<VertexId>>

Vertex lists of all the shortest paths, grouped by target in increasing target id order. Unreachable targets contribute no path.

edges: Vec<Vec<EdgeId>>

Edge lists of the same paths, in the same order.

nrgeo: Vec<i64>

Number of shortest paths from the source to each vertex (indexed by vertex id). Only accurate for the requested targets.

Trait Implementations

impl Clone for AllShortestPaths

fn clone(&self) -> AllShortestPaths

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AllShortestPaths

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

Formats the value using the given formatter.

impl Default for AllShortestPaths

fn default() -> AllShortestPaths

Returns the “default value” for a type.

impl Eq for AllShortestPaths

impl PartialEq for AllShortestPaths

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