Struct EulerianWalk 

pub struct EulerianWalk {
    pub vertices: Vec<VertexId>,
    pub edges: Vec<EdgeId>,
}

An Eulerian path or cycle, see Graph::eulerian_path and Graph::eulerian_cycle.

edges[i] connects vertices[i] and vertices[i + 1], so for a non-empty walk vertices.len() == edges.len() + 1; for a cycle the first and last vertices coincide. Every edge of the graph appears in edges exactly once.

Fields

vertices: Vec<VertexId>

The visited vertices, in order.

edges: Vec<EdgeId>

The traversed edges, in order.

Trait Implementations

impl Clone for EulerianWalk

fn clone(&self) -> EulerianWalk

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EulerianWalk

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

Formats the value using the given formatter.

impl Default for EulerianWalk

fn default() -> EulerianWalk

Returns the “default value” for a type.

impl Eq for EulerianWalk

impl Hash for EulerianWalk

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 EulerianWalk

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