Enum Adjacency 

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

How to interpret an adjacency matrix (igraph_adjacency_t).

Variants

Directed

Directed graph, A[i][j] edges from i to j.

Undirected

Undirected graph, the matrix must be symmetric.

Upper

Undirected graph from the upper triangle.

Lower

Undirected graph from the lower triangle.

Min

Undirected graph, min(A[i][j], A[j][i]) edges.

Plus

Undirected graph, A[i][j] + A[j][i] edges.

Max

Undirected graph, max(A[i][j], A[j][i]) edges.

Trait Implementations

impl Clone for Adjacency

fn clone(&self) -> Adjacency

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Adjacency

impl Debug for Adjacency

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

Formats the value using the given formatter.

impl Eq for Adjacency

impl From<Adjacency> for igraph_adjacency_t

fn from(value: Adjacency) -> igraph_adjacency_t

Converts to this type from the input type.

impl Hash for Adjacency

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 Adjacency

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

impl TryFrom<u32> for Adjacency

type Error = Error

The type returned in the event of a conversion error.

fn try_from(value: igraph_adjacency_t) -> Result<Self>

Performs the conversion.