pre-order

(graph theory)

pre-order

(theory)

A relation R is a pre-order if it is reflexive (x R x) and transitive (x R y R z => x R z). If it is also antisymmetric (x R y R x => x = y) then it is a partial ordering.

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

Mentioned in

driverless car
ordering
partial ordering
portable keyboard
pre-order traversal
reflexive
relation
traversal

All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.