Struct rustc_data_structures::graph::scc::Sccs

pub struct Sccs<N: Idx, S: Idx> { /* fields omitted */ }

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.

Methods

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

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

pub fn num_sccs(&self) -> usize

Returns the number of SCCs in the graph.

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

Returns an iterator over the SCCs in the graph.

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

Returns the SCC to which a node r belongs.

Important traits for &'a [u8]

impl<'a> Read for &'a [u8]impl<'a> Write for &'a mut [u8]

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

Returns the successors of the given SCC.