Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00155632n
Noun Concept
Categories: Search algorithms, Amortized data structures
EN
disjoint-set data structure  Merge-Find-Set  Merge-find set  disjoint-set forest  disjoint set
EN
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 sets. Wikipedia
Definitions
Relations
Sources
EN
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 sets. Wikipedia
A data structure used to track disjoint sets Wikipedia Disambiguation
IS A
data structure
tree
Wikipedia
EN
disjoint-set data structure
Wikidata
EN
disjoint-set data structure
Wikipedia Redirections
EN
disjoint-set forest, disjoint set (data structure), disjoint set data structure, Disjoint set forest, Find union, Merge-Find-Set, Merge-Find-set, Merge-find-set, Merge-find data structure, Merge-Find set, Merge-Find Set, Merge-find set, Mf set, Mfset, path compression, Proof of O(log*n) time complexity of union-find, Proof of O(log*n) time complexity of Union Find, Proof of O(log*n) time complexity of union–find, union-find, Union-find algorithm, Union-find data structure, Union-find problem, union find, Unionfind, Union–Find algorithm
Wikidata Alias
EN
merge–find set, union–find data structure

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License