Graph Theory

Graph Condensation

Transform any directed graph into a Directed Acyclic Graph (DAG) by contracting every strongly connected component into a single "super-vertex". This structural abstraction reveals the high-level reachability without the noise of internal cycles.

ComplexityO(V + E)

Result TypeDAG

Try Interactive Simulator

Component Contraction

Every node belonging to the same SCC is merged. Internal edges are discarded, and cross-component edges become super-edges.

Hierarchical View

Condensation provides a roadmap of the graph's dependency structure, making it easier to perform topological analysis on complex systems.

Input Graph

🖱️ Click to Add • ↔️ Drag to Move • ⌨️ Shift+Drag to Join

Super Graph (DAG)

Loading Lab...

Graph Theory

Graph Condensation

ComplexityO(V + E)

Result TypeDAG

Try Interactive Simulator

Component Contraction

Every node belonging to the same SCC is merged. Internal edges are discarded, and cross-component edges become super-edges.

Hierarchical View

Condensation provides a roadmap of the graph's dependency structure, making it easier to perform topological analysis on complex systems.

Input Graph

🖱️ Click to Add • ↔️ Drag to Move • ⌨️ Shift+Drag to Join