Struct RandomGraphStats 

pub struct RandomGraphStats {
    pub diameter: f64,
    pub mean_degree: f64,
}

The numbers computed by lesson 1 (see example_1).

Its Display implementation prints the same line as the C program, e.g. Diameter of a random graph with average degree 2: 23.

Fields

diameter: f64

Length of the longest geodesic, considering every connected component (the C program passes unconn = true).

mean_degree: f64

Average degree of the vertices, 2m / n (self-loops counted, as with IGRAPH_LOOPS in C).

Trait Implementations

impl Clone for RandomGraphStats

fn clone(&self) -> RandomGraphStats

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RandomGraphStats

impl Debug for RandomGraphStats

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

Formats the value using the given formatter.

impl Display for RandomGraphStats

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

Formats the value using the given formatter.

impl PartialEq for RandomGraphStats

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