{"version":"1.0","type":"link","title":"Disjoint-set data structure - Newikis","description":"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. Equivalently, it stores a partition of a set into disjoint subsets. It provides operations for adding new…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}