algograph::algorithm

Trait SimpleCycles

Source 
pub trait SimpleCycles
where
    Self: QueryableGraph + Sized,
{
    // Provided methods
    fn simple_cycles(
        &self,
    ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = Edge> + '_>> + '_> { ... }
    fn simple_cycles_reachable_from(
        &self,
        vert: &VertexId,
    ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = Edge> + '_>> + '_> { ... }
}
Expand description

Trait and default implementation of finding simple cycles on both directed and undirected graphs.

Provided Methods§

Source

fn simple_cycles( &self, ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = Edge> + '_>> + '_>

Iterates over all simple cycles of a graph.

Source

fn simple_cycles_reachable_from( &self, vert: &VertexId, ) -> Box<dyn Iterator<Item = Box<dyn Iterator<Item = Edge> + '_>> + '_>

Iterates over simple cycles only reachable from vert.

Dyn Compatibility§

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors§