Algorithms
Strongly Connected Components:Collapse a Directed Graph to a DAG
DFS to record finish order, transpose the digraph, DFS again in reverse finish order — each second-pass tree is a strongly connected component, and the condensation is a DAG.
Read More