Loading...
Finding maximal mutually reachable nodes in directed graphs.
Only for directed graphs
Group nodes that reach each other
Reduces groups to a DAG
A Strongly Connected Component (SCC) is a maximal subgraph where every vertex is reachable from every other vertex. In simpler terms, if you are in an SCC, you can travel from any node to any other node within that group and come back.
By collapsing each SCC into a single "super-node" and drawing edges between these groups, we get the **Condensation Graph**. Crucially, the condensation graph of any directed graph is always a **Direct Acyclic Graph (DAG)**. This property is vital for many higher-level graph algorithms.