A method of arranging the nodes in a directed acyclic graph into a linear order such that for every directed edge from node A to node B, node A comes before node B.
A method of arranging the nodes in a directed acyclic graph into a linear order such that for every directed edge from node A to node B, node A comes before node B.