o @@£i% ã@sdZddlZGdd„dƒZdS)uÍ 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. éNc@s¤eZdZdZdd„Zdd„Zdd„Zdd „Zd ej d dfd d „Z d ej d ej fdd„Z d ej d dfdd„Z d ej ej ej fdd„Zd ej dej d dfdd„ZdS)Ú disjointsetu 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 sets, merging sets (replacing them by their union), and finding a representative member of a set. The last operation allows to find out efficiently if any two elements are in the same or different sets. cCsi|_i|_dS©N©Ú_parentsÚ_ranks©Úself©r ú]/home/ubuntu/transcripts/venv/lib/python3.10/site-packages/borb/datastructure/disjoint_set.pyÚ__init__s zdisjointset.__init__cCs ||jvSr)r)rÚitemr r r Ú __contains__!ó zdisjointset.__contains__cCs |j ¡Sr)rÚ__iter__rr r r r$rzdisjointset.__iter__cCs t|jƒSr)Úlenrrr r r Ú__len__'rzdisjointset.__len__ÚxÚreturncCs||j|<d|j|<|S)zy Add an element to this disjointset :param x: the element to be added :return: self rr©rrr r r Úadd.s  zdisjointset.addcCs"|j||kr |S| |j|¡S)z¾ Find the root of an element in this disjointset :param x: the element for which to find the root element :return: the root element of the given element )rÚfindrr r r r8szdisjointset.findcCstƒ‚)z€ Remove an element from this disjointset :param x: the element to be removed :return: self )ÚNotImplementedErrorrr r r ÚpopCszdisjointset.popcCsRi}|j ¡D]\}}| |¡}||vrg||<|| |¡qdd„| ¡DƒS)z This function returns all equivalence sets in this disjointset :return: all equivalence sets of this disjointset cSsg|]\}}|‘qSr r )Ú.0ÚkÚvr r r Ú Vsz$disjointset.sets..)rÚitemsrÚappend)rÚcluster_parentsrÚ_Úpr r r ÚsetsKs zdisjointset.setsÚycCs„| |¡}| |¡}||ur|S|j||j|kr!||j|<|S|j||j|kr2||j|<|S||j|<|j|d7<|S)zë Mark two elements in this disjointset as equivalent, propagating the equivalence throughout the disjointset :param x: the first element :param y: the second element :return: self é)rrr)rrr#Úx_parentÚy_parentr r r ÚunionXs   û  þzdisjointset.unionN)Ú__name__Ú __module__Ú __qualname__Ú__doc__r r rrÚtypingÚAnyrrrÚListr"r'r r r r r s    r)r+r,rr r r r Ús