Struct EulerianStatus 

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

Whether a graph has an Eulerian path and/or cycle, see Graph::is_eulerian.

Fields

has_path: bool

true if some walk traverses every edge exactly once.

has_cycle: bool

true if some closed walk traverses every edge exactly once (this implies has_path).

Trait Implementations

impl Clone for EulerianStatus

fn clone(&self) -> EulerianStatus

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for EulerianStatus

impl Debug for EulerianStatus

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

Formats the value using the given formatter.

impl Eq for EulerianStatus

impl Hash for EulerianStatus

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 EulerianStatus

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