Graph Algorithms
Linear order of a DAG respecting every edge (Kahn's algorithm / DFS).
Detailed interactive content for “Topological Sorting” is planned for a later phase.
Linear order of a DAG respecting every edge (Kahn's algorithm / DFS).
The visualization engine is ready to be extended to this topic — the 12 core demonstrations below are fully interactive today.