Why use Kahn's algorithm for topological ordering when simple Queue + DFS is easier?
Selim Halac
242
Depth-First SearchBreadth-First Search

I'm asking to make sure I'm not missing anything. The standard topological sort is very easy. Is Kahn's a better runtime?

Comments (2)