Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pygraph/helpers/classes/__pycache__/disjoint_set.cpython-39.pyc
Ðазад
a ^�hq � @ s d Z G dd� de�ZdS )zEImplements a Union/Find Disjoint Set class, used in other algorithms.c @ sT e Zd ZdZdZdZdZdd� Zdd� Zdd � Z d d � Z d d � Z dd� Z dd� Z dS )� DisjointSetz0Implements an efficient disjoint set collection.� Nc C s i | _ d S �N��_DisjointSet__forest��self� r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/pygraph/helpers/classes/disjoint_set.py�__init__ s zDisjointSet.__init__c C s | j S r )�_DisjointSet__set_counterr r r r �__len__ s zDisjointSet.__len__c C s t | j�S r )�strr r r r r �__str__ s zDisjointSet.__str__c C s0 | j d7 _ | j }d| j|< | jd7 _|S )zeAdds a new set to the forest. Returns a label by which the new set can be referenced � ���)�_DisjointSet__label_counterr r )r Z new_labelr r r �add_set s zDisjointSet.add_setc C sH g }|}| j | dkr,|�|� | j | }q|}|D ]}|| j |< q4|S )zPFinds the set containing the node_label. Returns the set label. r )r �append)r Z node_label�queueZ current_nodeZ root_node�nr r r �find s zDisjointSet.findc C sJ ||kr dS | � |�}| � |�}||kr,dS | �||� | jd8 _dS )zhJoins two sets into a single new set. label_a, label_b can be any nodes within the sets Nr )r � _DisjointSet__internal_unionr )r Zlabel_aZlabel_b�root_a�root_br r r �union0 s zDisjointSet.unionc C sb d}| j | }| j | }||k r*|}|}n|}|}||kr>d}|| j |< |r^| j | d8 < dS )z�Internal function to join two set trees specified by root_a and root_b. Assumes root_a and root_b are distinct. FTr Nr )r r r Z update_rankZrank_aZrank_bZlargerZsmallerr r r Z__internal_unionC s z DisjointSet.__internal_union)�__name__� __module__� __qualname__�__doc__r r r r r r r r r r r r r r r s r N)r �objectr r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка