Definition: An extension or superset of a binary relation such that whenever (a,b) and (b,c) are in the extension, (a,c) is also in the extension.
See also transitive reduction, transitive.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 12 August 2019.
HTML page formatted Mon Aug 12 09:59:40 2019.
Cite this as:
Sandeep Kumar Shukla, "transitive closure", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 August 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/transitiveClosure.html