Topological Sort

Order tasks so every dependency comes first, using Kahn's algorithm, and detect a cycle by the tasks that can never become ready.

Math & convertDagKahnScheduling
Topological Sort screenshot

Order tasks so every dependency comes first, using Kahn's algorithm. Reports the order, the tasks that are ready at the start, and detects a cycle by the tasks that can never become ready. DAGKAHNSCHEDULING

build pipeline a cycle diamond dependency
Topological order
-
Tasks-
Dependencies-
Acyclic-
Sources (in-degree 0)-
Kahn's algorithm, one removal at a time
-

More tools