Order the vertices of a directed acyclic graph so every edge points forward, and see why a topological sort exists only when the graph contains no cycle.
Loading content...