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 E. Black.
Entry modified 1 June 2010.
HTML page formatted Tue Dec 6 16:16:33 2011.
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. 1 June 2010. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/topologicalSort.html