Definition: To arrange items when some pairs of items have no comparison, that is, according to a partial order.
Generalization (I am a kind of ...)
Aggregate child (... is a part of or used in me.)
See also topological order, directed acyclic graph.
Note: After [Leda98].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 25 March 2019.
HTML page formatted Mon Mar 25 12:35:26 2019.
Cite this as:
Paul E. Black, "topological sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 25 March 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/topologicalSort.html