ó |£*^c@sdZddd„ƒYZdS(s Union-find data structure. t UnionFindcBs2eZdZd„Zd„Zd„Zd„ZRS(sžUnion-find data structure. Each unionFind instance X maintains a family of disjoint sets of hashable objects, supporting the following two methods: - X[item] returns a name for the set containing the given item. Each set is named by an arbitrarily-chosen one of its members; as long as the set remains unchanged it will keep the same name. If the item is not yet part of a set in X, a new singleton set is created for it. - X.union(item1, item2, ...) merges the sets containing each item into a single larger set. If any item is not yet part of a set in X, it is added to X as one of the members of the merged set. Union-find data structure. Based on Josiah Carlson's code, http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/215912 with significant additional changes by D. Eppstein. http://www.ics.uci.edu/~eppstein/PADS/UnionFind.py cCsi|_i|_dS(s(Create a new empty union-find structure.N(tweightstparents(tself((sm/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/utils/union_find.pyt__init__#s cCs–||jkr-||j|GsN(tmaxRR(RtobjectstxtrootstheaviestR((Rsm/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/utils/union_find.pytunionCs   (t__name__t __module__t__doc__RR R R(((sm/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/utils/union_find.pyR s    N((RR(((sm/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/utils/union_find.pyts