[][src]Module rustc_data_structures::graph::scc

🔬 This is a nightly-only experimental API. (rustc_private)

this crate is being loaded from the sysroot, an unstable location; did you mean to load this crate from crates.io via Cargo.toml instead?

Routine to compute the strongly connected components (SCCs) of a graph, as well as the resulting DAG if each SCC is replaced with a node in the graph. This uses Tarjan's algorithm that completes in O(n) time.

Structs

SccData [
Experimental
]
Sccs [
Experimental
]

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.

SccsConstruction [
Experimental
]

Enums

NodeState [
Experimental
]
WalkReturn [
Experimental
]

Existentials

[
Experimental
]