(definition)
Definition: A binary relation R for which a R b and b R c implies a R c.
See also reflexive, symmetric.
Note: The relation "less than" is transitive: if a < b and b < c, then a < c. The relation "is an ancestor of" is also transitive: if Reuben is an ancestor of Bill and Bill is an ancestor of Patrick, Reuben is an ancestor of Patrick. However "likes" is not transitive since someone I like may like someone that I don't like.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:08:18 2004.
HTML page formatted Wed Oct 26 09:48:17 2005.
Cite this as:
Paul E. Black, "transitive", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/transitive.html
