Struct SitePercolation 

pub struct SitePercolation {
    pub giant_size: Vec<u32>,
    pub edge_count: Vec<u32>,
}

Outputs of site_percolation. Same length as vertex_order. giant_size[i] is the size of the largest connected component after vertex vertex_order[i] is activated; edge_count[i] is the cumulative number of edges added through step i (an edge is “added” the moment both its endpoints become active).

Fields

giant_size: Vec<u32>

Size of the largest connected component after the i-th vertex is activated.

edge_count: Vec<u32>

Cumulative count of edges activated through step i. An edge (u, v) activates the moment its second endpoint joins the active set. Self-loops on the just-activated vertex and parallel edges each count separately (matches upstream’s IGRAPH_LOOPS | IGRAPH_MULTIPLE neighbor enumeration).

Trait Implementations

impl Clone for SitePercolation

fn clone(&self) -> SitePercolation

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SitePercolation

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

Formats the value using the given formatter.

impl PartialEq for SitePercolation

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