(definition)
Definition: An order defined for some, but not necessarily all, pairs of items. For instance, the sets {a, b} and {a, c, d} are subsets of {a, b, c, d}, but neither is a subset of the other. So "subset of" is a partial order on sets.
Formal Definition: A partial order is a binary relation that is reflexive, transitive, and antisymmetric.
See also total order, poset.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:06:20 2004.
HTML page formatted Wed Oct 26 09:47:55 2005.
Cite this as:
Paul E. Black and Paul J. Tanenbaum, "partial order", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/partialorder.html
