topological sort


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.)
partial order.

See also topological order, directed acyclic graph.

Note: After [Leda98].

Author: PEB


Eric Lippert's narrative example and solution (JScript). (C++, Mathematica, C, and Pascal)
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 15 July 2019.
HTML page formatted Mon Jul 15 12:55:43 2019.

Cite this as:
Paul E. Black, "topological sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 July 2019. (accessed TODAY) Available from: