transitive closure

(definition)

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.

Author: SKS

Implementation

Steven Skiena's Algorist/Stony Brook summary and links to implementations (C++, Java, and Mathematica). (Java) from Sedgewick and Wayne "Algorithms" 4th edition.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 22 November 2021.
HTML page formatted Mon Nov 22 06:32:06 2021.

Cite this as:
Sandeep Kumar Shukla, "transitive closure", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 22 November 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/transitiveClosure.html