Struct ReindexMembershipResult 

pub struct ReindexMembershipResult {
    pub membership: Vec<u32>,
    pub new_to_old: Vec<u32>,
}

Result of reindex_membership: a densified membership vector [0, k), the old cluster id behind each new id (so new_to_old[i] is the original id that now maps to i), and the number of distinct clusters k = new_to_old.len().

Fields

membership: Vec<u32>

membership[v] ∈ [0, k) — the densified cluster id of vertex v.

new_to_old: Vec<u32>

new_to_old[i] — the original cluster id that vertex encounters with this id now map to. nb_clusters = new_to_old.len().

Implementations

impl ReindexMembershipResult

pub fn nb_clusters(&self) -> u32

Number of distinct clusters in the densified membership.

Examples

use rust_igraph::reindex_membership;

let r = reindex_membership(&[5, 5, 10, 10, 5]).unwrap();
assert_eq!(r.nb_clusters(), 2);

Trait Implementations

impl Clone for ReindexMembershipResult

fn clone(&self) -> ReindexMembershipResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReindexMembershipResult

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

Formats the value using the given formatter.

impl Eq for ReindexMembershipResult

impl PartialEq for ReindexMembershipResult

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