A graph traversal algorithm that orders the nodes in a graph such that for every directed edge (u, v), node u comes before node v in the ordering.
A graph traversal algorithm that orders the nodes in a graph such that for every directed edge (u, v), node u comes before node v in the ordering.