Topological sort is well-defined for

Topological sort requires that all edges go forward in the ordering. A cycle would force each of its vertices to precede the others — impossible. So topological sort applies only to directed acyclic graphs. Both DFS-based and Kahn's algorithm detect cycles when they appear: DFS finds a back edge, Kahn's queue empties early.