Struct PathLengthHistogram 

pub struct PathLengthHistogram {
    pub counts: Vec<f64>,
    pub unconnected: f64,
}

Histogram of shortest path lengths, see Graph::path_length_hist.

Fields

counts: Vec<f64>

counts[i] is the number of vertex pairs at distance i + 1.

unconnected: f64

The number of vertex pairs whose second vertex is unreachable from the first.

Trait Implementations

impl Clone for PathLengthHistogram

fn clone(&self) -> PathLengthHistogram

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PathLengthHistogram

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

Formats the value using the given formatter.

impl Default for PathLengthHistogram

fn default() -> PathLengthHistogram

Returns the “default value” for a type.

impl PartialEq for PathLengthHistogram

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