Trait Scc 

pub trait Scc {
    type Vertex: Copy + Eq + Hash;

    // Required methods
    fn vertices(&self) -> impl '_ + IntoIterator<Item = Self::Vertex>;
    fn successors(
        &self,
        v: Self::Vertex,
    ) -> impl '_ + IntoIterator<Item = Self::Vertex>;

    // Provided method
    fn strongly_connected_components(&self) -> Components<Self::Vertex> { ... }
}

Graph on which strongly connected components can be computed.

Required Associated Types

type Vertex: Copy + Eq + Hash

Graph vertex reference type.

Required Methods

fn vertices(&self) -> impl '_ + IntoIterator<Item = Self::Vertex>

Returns an iterator over the vertices of the graph.

fn successors( &self, v: Self::Vertex, ) -> impl '_ + IntoIterator<Item = Self::Vertex>

Returns an iterator over the successors of the given vertex.

Provided Methods

fn strongly_connected_components(&self) -> Components<Self::Vertex>

Computes the strongly connected components of the graph.

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.

Implementations on Foreign Types

impl Scc for Vec<HashSet<usize>>

type Vertex = usize

fn vertices(&self) -> impl '_ + IntoIterator<Item = Self::Vertex>

fn successors( &self, v: Self::Vertex, ) -> impl '_ + IntoIterator<Item = Self::Vertex>

impl<T: Copy + Eq + Hash> Scc for HashMap<T, HashSet<T>>

type Vertex = T

fn vertices(&self) -> impl '_ + IntoIterator<Item = Self::Vertex>

fn successors( &self, v: Self::Vertex, ) -> impl '_ + IntoIterator<Item = Self::Vertex>

Implementors