Enum CommunityAlgorithm 

pub enum CommunityAlgorithm {
    Louvain,
    Leiden,
    LabelPropagation,
    ConnectedComponents,
}

Community detection algorithm

Variants

Louvain

Louvain algorithm (fast, good quality)

Leiden

Leiden algorithm (improved Louvain)

LabelPropagation

Label propagation (very fast, lower quality)

ConnectedComponents

Connected components (simplest)

Trait Implementations

impl Clone for CommunityAlgorithm

fn clone(&self) -> CommunityAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CommunityAlgorithm

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

Formats the value using the given formatter.

impl Default for CommunityAlgorithm

fn default() -> CommunityAlgorithm

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for CommunityAlgorithm

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for CommunityAlgorithm

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for CommunityAlgorithm

impl Eq for CommunityAlgorithm

impl StructuralPartialEq for CommunityAlgorithm