Enum LoopHandling 

pub enum LoopHandling {
    NoLoops,
    Once,
    Twice,
}

How to count self-loop edges in the adjacency matrix diagonal.

Variants

NoLoops

Ignore loops — diagonal is always zero.

Once

Count each loop once.

Twice

Count each loop twice for undirected graphs (once for directed).

Trait Implementations

impl Clone for LoopHandling

fn clone(&self) -> LoopHandling

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LoopHandling

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

Formats the value using the given formatter.

impl PartialEq for LoopHandling

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

impl Eq for LoopHandling

impl StructuralPartialEq for LoopHandling