topological sorts

Does Topological Sort Handle Cycles? If the graph has a cycle, a topological order cannot exist. Imagine the simplest cycle, consist- ing of two edges: (a, b) and (b, a). A topological ordering , if it existed, would have to satisfy that a must come before b and b must come before a. This is