Topological sorting

Home > Mathematics > Graph theory > Graph algorithms > Topological sorting

Used to order the nodes in a directed acyclic graph (DAG) in such a way that if there is an edge from node A to node B, then A appears before B in the order.