Kahn's algorithm

Also written: Kahn

A way to produce a topological order by repeatedly taking a task with in-degree 0 and lowering the in-degrees of the tasks after it. If the order comes out short, there is a cycle.