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) (Python). topological sort for directed graphs (Java) from Sedgewick and Wayne "Algorithms" 4th edition.
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 21 April 2022.
HTML page formatted Thu Apr 21 14:52:02 2022.

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