Struct LatticePathLengths 

pub struct LatticePathLengths {
    pub lattice: f64,
    pub randomized: f64,
    pub random_edges: Vec<(VertexId, VertexId)>,
}

The numbers computed by lesson 2 (see example_2).

Its Display implementation prints the same two lines as the C program.

Fields

lattice: f64

Average shortest path length of the 30 × 30 periodic lattice.

randomized: f64

Average shortest path length after adding random_edges.

random_edges: Vec<(VertexId, VertexId)>

The ten random edges added to the lattice, in the order they were drawn. Such random draws may in general produce loops and multi-edges; the ten edges drawn after seeding with 42 happen to contain neither.

Trait Implementations

impl Clone for LatticePathLengths

fn clone(&self) -> LatticePathLengths

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LatticePathLengths

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

Formats the value using the given formatter.

impl Display for LatticePathLengths

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

Formats the value using the given formatter.

impl PartialEq for LatticePathLengths

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