Find any valid topological ordering of a directed acyclic graph given as an adjacency list, so that for every directed edge from u to v, vertex u appears before vertex v.
Loading content...