All Ancestors of a Node in a Directed Acyclic Graph

Given a DAG with n nodes and directed edges, compute for each node the sorted list of all nodes that can reach it (its ancestors). This is essentially computing the transitive closure/reachability for every node, leveraging the DAG/topological ordering to do it efficiently within the n ≤ 1000 constraint.