4[gdZGddZy)z Disjoint set data structure cTeZdZdZddZdZdZdZdZdZ d Z d Z d Z d Z d Zy) DisjointSeta Disjoint set data structure for incremental connectivity queries. .. versionadded:: 1.6.0 Attributes ---------- n_subsets : int The number of subsets. Methods ------- add merge connected subset subset_size subsets __getitem__ Notes ----- This class implements the disjoint set [1]_, also known as the *union-find* or *merge-find* data structure. The *find* operation (implemented in `__getitem__`) implements the *path halving* variant. The *merge* method implements the *merge by size* variant. References ---------- .. [1] https://en.wikipedia.org/wiki/Disjoint-set_data_structure Examples -------- >>> from scipy.cluster.hierarchy import DisjointSet Initialize a disjoint set: >>> disjoint_set = DisjointSet([1, 2, 3, 'a', 'b']) Merge some subsets: >>> disjoint_set.merge(1, 2) True >>> disjoint_set.merge(3, 'a') True >>> disjoint_set.merge('a', 'b') True >>> disjoint_set.merge('b', 'b') False Find root elements: >>> disjoint_set[2] 1 >>> disjoint_set['b'] 3 Test connectivity: >>> disjoint_set.connected(1, 2) True >>> disjoint_set.connected(1, 'b') False List elements in disjoint set: >>> list(disjoint_set) [1, 2, 3, 'a', 'b'] Get the subset containing 'a': >>> disjoint_set.subset('a') {'a', 3, 'b'} Get the size of the subset containing 'a' (without actually instantiating the subset): >>> disjoint_set.subset_size('a') 3 Get all subsets in the disjoint set: >>> disjoint_set.subsets() [{1, 2}, {'a', 3, 'b'}] Ncd|_i|_i|_i|_i|_||D]}|j |yy)N) n_subsets_sizes_parents_nbrs_indicesadd)selfelementsxs S/var/www/html/bid-api/venv/lib/python3.12/site-packages/scipy/_lib/_disjoint_set.py__init__zDisjointSet.__init__[sE       c,t|jS)zsReturns an iterator of the elements in the disjoint set. Elements are ordered by insertion order. )iterr r s r__iter__zDisjointSet.__iter__gs DMM""rc,t|jSN)lenr rs r__len__zDisjointSet.__len__ns4==!!rc||jvSrr r rs r __contains__zDisjointSet.__contains__qsDMM!!rc||jvr t||j}|j||j||k7r3|||||<||}|j||j||k7r3|S)zFind the root element of `x`. Parameters ---------- x : hashable object Input element. Returns ------- root : hashable object Root element of `x`. )r KeyErrorr)r rparentss r __getitem__zDisjointSet.__getitem__ts DMM !1+ --mmA$-- ";; ,GAJ AmmA$-- ";;rc||jvryd|j|<||j|<||j|<t |j|j|<|xj dz c_y)z(Add element `x` to disjoint set N)r rrr rrrs rr zDisjointSet.adds`    A a 1 t}}- a !rc||}||}|j||j|k(ry|j}|||j|f|||j|fkr||}}||j|<|j|xx|j|z cc<|j||j|c|j|<|j|<|xjdzc_y)aMerge the subsets of `x` and `y`. The smaller subset (the child) is merged into the larger subset (the parent). If the subsets are of equal size, the root element which was first inserted into the disjoint set is selected as the parent. Parameters ---------- x, y : hashable object Elements to merge. Returns ------- merged : bool True if `x` and `y` were in disjoint sets, False otherwise. Fr#T)r rrr r)r ryxryrsizess rmergezDisjointSet.merges"!W !W ==  b 1 1  "It}}R( )U2Y b8I,J JB b B4;;r?*)-BB& 2 2 !rcL|j|||j||k(S)aTest whether `x` and `y` are in the same subset. Parameters ---------- x, y : hashable object Elements to test. Returns ------- result : bool True if `x` and `y` are in the same set, False otherwise. r)r rr%s r connectedzDisjointSet.connecteds)}}T!W%tAw)???rc,||jvr t||g}|j|}|j||j|k7r@|j||j|}|j||j|k7r@t |S)zGet the subset containing `x`. Parameters ---------- x : hashable object Input element. Returns ------- result : set Subset containing `x`. )r rr appendset)r rresultnxts rsubsetzDisjointSet.subsets DMM !1+ jjmmmC DMM!$44 MM# **S/CmmC DMM!$446{rc&|j||S)aGet the size of the subset containing `x`. Note that this method is faster than ``len(self.subset(x))`` because the size is directly read off an internal field, without the need to instantiate the full subset. Parameters ---------- x : hashable object Input element. Returns ------- result : int Size of the subset containing `x`. )rrs r subset_sizezDisjointSet.subset_sizes"{{47##rcg}t}|D]:}||vs|j|}|j||j|<|S)zGet all the subsets in the disjoint set. Returns ------- result : list Subsets in the disjoint set. )r.r1updater-)r r/visitedrxsets rsubsetszDisjointSet.subsetssN%A{{1~t$ d#   rr)__name__ __module__ __qualname____doc__rrrrr!r r)r+r1r3r8rrrrsASh #"". > @.$&rrN)r<rr=rrr>s xxr