Topological search and Breadth first search

Question

Is it possible to use Breadth first search logic to do a topological sort of a DAG? The solution in Cormen makes use of Depth first search but wouldn\'t be easier to use BFS

Answer 1

It is possible, even wikipedia describes an algorithm based on BFS.

Basically, you use a queue in which you insert all nodes with no incoming edges. Then, when you extract a node, you remove all of its outgoing edges and insert the nodes reachable from it that have no other incoming edges.