Struct Leiden 

pub struct Leiden {
    pub membership: Vec<i64>,
    pub nb_clusters: usize,
    pub quality: f64,
}

Result of the Leiden algorithm, see Graph::community_leiden.

Fields

membership: Vec<i64>

Community id of each vertex.

nb_clusters: usize

Number of clusters in membership.

quality: f64

Value of the optimized objective function (quality) of the partition.

Implementations

impl Leiden

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.

Trait Implementations

impl Clone for Leiden

fn clone(&self) -> Leiden

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Leiden

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

Formats the value using the given formatter.

impl PartialEq for Leiden

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