Sccs in rustc_data_structures::graph::scc - Rust (original) (raw)

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.

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

Data about all the SCCs.

Source§

Source

Compute SCCs without annotations.

Source

Compute SCCs and annotate them with a user-supplied annotation

Source

Source

Returns the number of SCCs in the graph.

Source

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 visitS1, the value for S2 will already have been computed.

Source

Returns the SCC to which a node r belongs.

Source

Returns the successors of the given SCC.

Source

Construct the reverse graph of the SCC graph.

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