Struct EdgelistPercolation 

pub struct EdgelistPercolation {
    pub giant_size: Vec<u32>,
    pub vertex_count: Vec<u32>,
}

Outputs of edgelist_percolation. Same length as the input edge slice. giant_size[i] is the size of the largest component after edge i is added; vertex_count[i] is the number of distinct vertices touched by edges 0..=i.

Fields

giant_size: Vec<u32>

Size of the largest connected component after edge i is added.

vertex_count: Vec<u32>

Cumulative count of distinct vertices touched by any edge in 0..=i.

Trait Implementations

impl Clone for EdgelistPercolation

fn clone(&self) -> EdgelistPercolation

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EdgelistPercolation

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

Formats the value using the given formatter.

impl PartialEq for EdgelistPercolation

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