Module rustc_data_structures::graph::scc [−][src]
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
Sccs |
Strongly connected components (SCC) of a graph. The type |