Kahn's Algorithm

BFS driven by in-degree counting — repeatedly peel off nodes with no remaining incoming edges.