(definition)
Definition: A set whose members do not overlap, are not duplicated, etc.
Note: For example, the set of intervals {[1,5], [4,7], [8,9]} is not disjoint since [1,5] overlaps [4,7].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "disjoint set", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/disjointset.html