Topological Sort
New Graph
Step (Kahn's Algo)
Run All
Click "Step" to run Kahn's algorithm.
Directed acyclic graph. Kahn's algorithm: repeatedly remove nodes with in-degree 0. Click nodes to highlight.