Actually I had thought of this, but topological sort cannot work with cycles in a DAG. Lets say you have a graph such as A->B->C->D->E->B. Now there is a cycle and you cannot find the topological order but transitive reduction exists which is same as the original graph because you cannot remove any edge here.