Enum AdjacencyMode 

pub enum AdjacencyMode {
    Directed,
    Undirected,
    Max,
    Min,
    Plus,
    Upper,
    Lower,
}

How to interpret the input matrix as an adjacency matrix.

Matches igraph_adjacency_t from include/igraph_constructors.h.

Variants

Directed

Directed graph; A(i, j) is the multiplicity of the arc i → j.

Undirected

Undirected graph; A(i, j) is the multiplicity of the edge {i, j}. The matrix must be symmetric.

Max

Undirected; the edge multiplicity of {i, j} is max(A(i, j), A(j, i)).

Min

Undirected; the edge multiplicity of {i, j} is min(A(i, j), A(j, i)).

Plus

Undirected; the edge multiplicity of {i, j} is A(i, j) + A(j, i).

Upper

Undirected; only entries with i < j (the strict upper triangle) plus the diagonal contribute edges.

Lower

Undirected; only entries with i > j (the strict lower triangle) plus the diagonal contribute edges.

Trait Implementations

impl Clone for AdjacencyMode

fn clone(&self) -> AdjacencyMode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AdjacencyMode

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

Formats the value using the given formatter.

impl Hash for AdjacencyMode

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for AdjacencyMode

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

impl Eq for AdjacencyMode

impl StructuralPartialEq for AdjacencyMode