Struct Multilevel 

pub struct Multilevel {
    pub membership: Vec<i64>,
    pub levels: Vec<Vec<i64>>,
    pub modularities: Vec<f64>,
}

Result of the multi-level (Louvain) algorithm, see Graph::community_multilevel.

Fields

membership: Vec<i64>

Community id of each vertex in the final (best) level.

levels: Vec<Vec<i64>>

Membership vector after each aggregation level, coarsest last (the last one equals membership). Empty if no merge improved modularity, in which case every vertex is its own community.

modularities: Vec<f64>

Modularity (at the requested resolution) after each level, in the order of levels; if levels is empty, the single value is the modularity of the singleton partition.

Implementations

impl Multilevel

pub fn num_communities(&self) -> usize

Number of communities in membership.

pub fn sizes(&self) -> Vec<usize>

Size of each community, indexed by community id.

pub fn communities(&self) -> Vec<Vec<VertexId>>

The vertices of each community, indexed by community id.

impl Multilevel

pub fn modularity(&self) -> f64

Modularity of the final partition (the last entry of modularities), NaN if it is empty.

Trait Implementations

impl Clone for Multilevel

fn clone(&self) -> Multilevel

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Multilevel

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

Formats the value using the given formatter.

impl PartialEq for Multilevel

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