Definitions from Wikipedia (Disjoint-set data structure)

▸ noun:  In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection of disjoint (non-overlapping) sets.


▸ Words similar to disjoint-set data structure
▸ Usage examples for disjoint-set data structure

▸ Idioms related to disjoint-set data structure
▸ Wikipedia articles (New!)
▸ Words that often appear near disjoint-set data structure
▸ Rhymes of disjoint-set data structure

▸ Invented words related to disjoint-set data structure