Struct LabelPropagationOptions 

pub struct LabelPropagationOptions<'a> {
    pub mode: NeighborMode,
    pub initial: Option<&'a [i64]>,
    pub fixed: Option<&'a [bool]>,
    pub variant: LpaVariant,
}

Options of Graph::community_label_propagation.

Fields

mode: NeighborMode

Direction of label propagation in directed graphs (default NeighborMode::All: ignore directions). Out propagates labels along the edges, In backwards.

initial: Option<&'a [i64]>

Initial labels, one per vertex: a label is an id in 0..vcount, and negative values mean “unlabeled” (default None: every vertex has its own label). Label values carry no meaning and may be renumbered; only co-membership matters.

fixed: Option<&'a [bool]>

Which initial labels are fixed (only meaningful with initial; unlabeled vertices cannot be fixed, and igraph ignores their flag with a warning). Fixed vertices keep their co-membership: two fixed vertices end up in the same community iff they had the same initial label.

variant: LpaVariant

Algorithm variant (default LpaVariant::Dominance).

Trait Implementations

impl<'a> Clone for LabelPropagationOptions<'a>

fn clone(&self) -> LabelPropagationOptions<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for LabelPropagationOptions<'a>

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

Formats the value using the given formatter.

impl Default for LabelPropagationOptions<'_>

fn default() -> Self

Returns the “default value” for a type.

impl<'a> PartialEq for LabelPropagationOptions<'a>

fn eq(&self, other: &LabelPropagationOptions<'a>) -> 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<'a> StructuralPartialEq for LabelPropagationOptions<'a>