Struct petgraph::algo::Cycle

pub struct Cycle<N>(/* private fields */);

An algorithm error: a cycle was found in the graph.

Implementations

impl<N> Cycle<N>

pub fn node_id(&self) -> N

where N: Copy,

Return a node id that participates in the cycle

Trait Implementations

impl<N: Clone> Clone for Cycle<N>

fn clone(&self) -> Cycle<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug> Debug for Cycle<N>

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

Formats the value using the given formatter.

impl<N: PartialEq> PartialEq for Cycle<N>

fn eq(&self, other: &Cycle<N>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N> StructuralPartialEq for Cycle<N>