Struct WidestPaths 

pub struct WidestPaths {
    pub widths: Vec<Option<f64>>,
    pub parents: Vec<Option<VertexId>>,
    pub inbound_edges: Vec<Option<u32>>,
}

Sidecar outputs from a single-source widest-paths run. Carries the widths vector plus the parent-pointer SPT (vertex-side and edge-side). Counterpart of the parents and inbound_edges outputs of igraph_get_widest_paths. Source itself has parents[source] == None and inbound_edges[source] == None; unreachable vertices also have both None. To disambiguate the source from unreachable targets, consult widths: source has Some(f64::INFINITY), unreachable has None.

Fields

widths: Vec<Option<f64>>

widths[v]: Some(f64::INFINITY) for v == source, Some(w) for reachable, None for unreachable.

parents: Vec<Option<VertexId>>

parents[v] is the predecessor of v in the widest-paths spanning tree. None for source and unreachable.

inbound_edges: Vec<Option<u32>>

inbound_edges[v] is the edge id v was reached through. None for source and unreachable.

Trait Implementations

impl Clone for WidestPaths

fn clone(&self) -> WidestPaths

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WidestPaths

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

Formats the value using the given formatter.

impl PartialEq for WidestPaths

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