Enum Loops 

pub enum Loops {
    None,
    Twice,
    Once,
}

How self-loops are counted (igraph_loops_t).

Variants

None

Ignore loop edges.

Twice

Count each loop twice, as it has two endpoints at the same vertex (the graph theoretical convention, which keeps the handshake lemma true).

Once

Count each loop once. Only meaningful when edge directions are ignored: for out- or in-degrees of directed graphs each loop counts once anyway.

Trait Implementations

impl Clone for Loops

fn clone(&self) -> Loops

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Loops

impl Debug for Loops

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

Formats the value using the given formatter.

impl Eq for Loops

impl From<Loops> for igraph_loops_t

fn from(value: Loops) -> igraph_loops_t

Converts to this type from the input type.

impl From<bool> for Loops

fn from(loops: bool) -> Self

true maps to Loops::Twice (igraph’s IGRAPH_LOOPS), false to Loops::None.

impl Hash for Loops

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 Loops

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

impl TryFrom<u32> for Loops

type Error = Error

The type returned in the event of a conversion error.

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

Performs the conversion.