Struct EulerianClassification 

pub struct EulerianClassification {
    pub has_path: bool,
    pub has_cycle: bool,
}

Whether an Eulerian path or cycle exists in a graph.

Fields

has_path: bool

true iff there exists a walk that traverses every edge exactly once.

has_cycle: bool

true iff there exists a closed walk that traverses every edge exactly once. Implies has_path.

Trait Implementations

impl Clone for EulerianClassification

fn clone(&self) -> EulerianClassification

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EulerianClassification

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

Formats the value using the given formatter.

impl PartialEq for EulerianClassification

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

impl Eq for EulerianClassification

impl StructuralPartialEq for EulerianClassification