Strongly connected components (SCC) of a graph. The type
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.
scc_indices: IndexVec<N, S>
For each node, what is the SCC index of the SCC to which it belongs.
Data about each SCC.
pub fn new( graph: &(impl DirectedGraph<Node = N> + WithNumNodes + WithSuccessors) ) -> Self
pub fn scc_indices(&self) -> &IndexSlice<N, 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
This is convenient when the edges represent dependencies: when you visit
S1, the value for
S2 will already have been computed.
Auto Trait Implementations§
impl<N, S> RefUnwindSafe for Sccs<N, S>where
impl<N, S> UnwindSafe for Sccs<N, S>where
impl<'a, T> Captures<'a> for T
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