NIST

topological sort

(definition)

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 ...)
sort.

Aggregate child (... is a part of or used in me.)
partial order.

See also topological order, directed acyclic graph.

Note: After [Leda98].

Author: PEB

Implementation

Eric Lippert's narrative example and solution (JScript). (C++, Mathematica, C, and Pascal)

More information

An example with relation to a directed acyclic graph (DAG).

Go to the Dictionary of Algorithms and Data Structures home page.

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

Entry modified 9 November 2006.
HTML page formatted Tue Oct 9 11:43:47 2007.

Cite this as:
Paul E. Black, "topological sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 9 November 2006. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/topologicalSort.html

to NIST home page