1. < graph theory > traversal .
2. 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 .
(2001-10-01)
1. < graph theory > traversal .
2. 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 .
(2001-10-01)
FOLDOC computer English dictionary. Английский словарь по компьютерам FOLDOC. 2012