pub struct Sccs<N: Idx, S: Idx> {
    scc_indices: IndexVec<N, S>,
    scc_data: SccData<S>,
}
Expand description

Strongly connected components (SCC) of a graph. The type N is the index type for the graph nodes and S is the index type for the SCCs. We can map from each node to the SCC that it participates in, and we also have the successors of each SCC.

Fields§

§scc_indices: IndexVec<N, S>

For each node, what is the SCC index of the SCC to which it belongs.

§scc_data: SccData<S>

Data about each SCC.

Implementations§

source§

impl<N: Idx, S: Idx + Ord> Sccs<N, S>

source

pub fn new( graph: &(impl DirectedGraph<Node = N> + WithNumNodes + WithSuccessors) ) -> Self

source

pub fn scc_indices(&self) -> &IndexSlice<N, S>

source

pub fn scc_data(&self) -> &SccData<S>

source

pub fn num_sccs(&self) -> usize

Returns the number of SCCs in the graph.

source

pub fn all_sccs(&self) -> impl Iterator<Item = S>

Returns an iterator over the SCCs in the graph.

The SCCs will be iterated in dependency order (or post order), meaning that if S1 -> S2, we will visit S2 first and S1 after. This is convenient when the edges represent dependencies: when you visit S1, the value for S2 will already have been computed.

source

pub fn scc(&self, r: N) -> S

Returns the SCC to which a node r belongs.

source

pub fn successors(&self, scc: S) -> &[S]

Returns the successors of the given SCC.

source

pub fn reverse(&self) -> VecGraph<S>

Construct the reverse graph of the SCC graph.

Trait Implementations§

source§

impl<N: Idx, S: Idx> DirectedGraph for Sccs<N, S>

§

type Node = S

source§

impl<'graph, N: Idx, S: Idx> GraphSuccessors<'graph> for Sccs<N, S>

§

type Item = S

§

type Iter = Cloned<Iter<'graph, S>>

source§

impl<N: Idx, S: Idx> WithNumEdges for Sccs<N, S>

source§

impl<N: Idx, S: Idx + Ord> WithNumNodes for Sccs<N, S>

source§

impl<N: Idx, S: Idx + Ord> WithSuccessors for Sccs<N, S>

source§

fn successors(&self, node: S) -> <Self as GraphSuccessors<'_>>::Iter

Auto Trait Implementations§

§

impl<N, S> RefUnwindSafe for Sccs<N, S>where S: RefUnwindSafe,

§

impl<N, S> Send for Sccs<N, S>where S: Send,

§

impl<N, S> Sync for Sccs<N, S>where S: Sync,

§

impl<N, S> Unpin for Sccs<N, S>where S: Unpin,

§

impl<N, S> UnwindSafe for Sccs<N, S>where S: UnwindSafe,

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = const ALIGN: Alignment = Alignment::of::<Self>();

Alignment of Self.
source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<'a, T> Captures<'a> for Twhere T: ?Sized,

Layout§

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 72 bytes