Topological Sort

Home > Mathematics > Graph theory > Tree Graphs > Topological Sort

This is a linear ordering of nodes in a directed acyclic graph (DAG) such that every node comes before all the nodes that follow it.