Orders a Directed Acyclic Graph (DAG) linearly such that for every directed edge U -> V, node U comes before V. DFS solves this natively using a post-order stack process.