Topological Sorting

Given a directed acyclic graph (DAG), perform a topological sort and return the linear ordering of vertices that respects the partial order.

Loading...