Struct scc_trait::Components

pub struct Components<V> { /* private fields */ }

Strongly connected components.

Implementations

impl<V> Components<V>

pub fn len(&self) -> usize

Returns the number of strongly connected components.

pub fn is_empty(&self) -> bool

Checks if there are no components.

pub fn iter(&self) -> impl Iterator<Item = &[V]>

Returns an iterator over the strongly connected components.

pub fn vertex_component_index(&self, v: &V) -> Option<usize>

where V: Eq + Hash,

Returns the index of the given vertex’s strongly connected component.

pub fn get_by_index(&self, i: usize) -> Option<&[V]>

Returns the component with the given index i.

pub fn get(&self, v: &V) -> Option<&[V]>

where V: Eq + Hash,

Return the given vertex’s strongly connected component.

pub fn successors(&self, i: usize) -> Option<impl '_ + Iterator<Item = usize>>

pub fn is_cyclic(&self, i: usize) -> bool

pub fn direct_successors(&self, i: usize) -> Option<HashSet<usize>>

pub fn depths(&self) -> Vec<usize>

Returns the depth of each component.

The depth of a component is the maximum of the depth of its predecessors plus 1. A component with no predecessors has depth 0.

pub fn predecessors(&self) -> Vec<HashSet<usize>>

pub fn order_by_depth(&self) -> Vec<usize>

Order components by depth.

The depth of a component is the maximum of the depth of its predecessors plus 1. A component with no predecessors has depth 0.