Enum EigenvectorMode 

pub enum EigenvectorMode {
    Out,
    In,
    All,
}

How to consider edge directions for eigenvector_centrality_full and friends. Mirrors upstream’s IGRAPH_OUT / IGRAPH_IN / IGRAPH_ALL.

Variants

Out

Standard convention: centrality of v is proportional to the sum of centralities of vertices pointing to v (we walk incoming edges of v). Equivalent to ARPACK’s “left eigenvector of the adjacency matrix”.

In

Reverse convention: centrality of v is proportional to the sum of centralities of vertices v points to (we walk outgoing edges of v). Equivalent to ARPACK’s “right eigenvector”.

All

Treat the graph as undirected and use the symmetric eigenvector path. Mandatory for undirected input.

Trait Implementations

impl Clone for EigenvectorMode

fn clone(&self) -> EigenvectorMode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EigenvectorMode

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

Formats the value using the given formatter.

impl PartialEq for EigenvectorMode

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

impl Eq for EigenvectorMode

impl StructuralPartialEq for EigenvectorMode