Struct Cycle 

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

A cycle (closed walk) of a graph, given both as vertices and edges.

edges[i] connects vertices[i] and vertices[(i + 1) % len]: the first vertex is not repeated at the end, so vertices.len() == edges.len(), which is the length of the cycle. A self-loop is a cycle of length 1, and two parallel edges form a cycle of length 2 (when they can be traversed in opposite directions: undirected edges, mutual directed edges, or any directed edges with NeighborMode::All).

Fields

vertices: Vec<VertexId>

The vertices of the cycle, in traversal order.

edges: Vec<EdgeId>

The edges of the cycle, in traversal order.

Implementations

impl Cycle

pub fn len(&self) -> usize

The length of the cycle, i.e. its number of edges.

pub fn is_empty(&self) -> bool

Whether the cycle has no edges (never the case for cycles returned by this module).

Trait Implementations

impl Clone for Cycle

fn clone(&self) -> Cycle

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Cycle

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

Formats the value using the given formatter.

impl Default for Cycle

fn default() -> Cycle

Returns the “default value” for a type.

impl Eq for Cycle

impl Hash for Cycle

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 Cycle

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