Enum LeadingEigenvectorEvent 

pub enum LeadingEigenvectorEvent {
    StartFull,
    StartGiven {
        communities: i64,
    },
    Split {
        community: i64,
    },
    Failed {
        community: i64,
    },
}

One step of the history of Graph::community_leading_eigenvector (igraph_leading_eigenvector_community_history_t).

Variants

StartFull

The algorithm started from the connected components of the graph.

StartGiven

The algorithm started from a given partition with this many communities.

Fields

communities: i64

Initial number of communities.

Split

A community was split in two: the first part keeps the id, the second one gets the number of communities before the split as id.

Fields

community: i64

The id of the split community.

Failed

Splitting the community would not increase modularity.

Fields

community: i64

The id of the community that was not split.

Trait Implementations

impl Clone for LeadingEigenvectorEvent

fn clone(&self) -> LeadingEigenvectorEvent

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for LeadingEigenvectorEvent

impl Debug for LeadingEigenvectorEvent

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

Formats the value using the given formatter.

impl Eq for LeadingEigenvectorEvent

impl Hash for LeadingEigenvectorEvent

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for LeadingEigenvectorEvent

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