Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pygraph/classes/__pycache__/undirected_graph.cpython-39.pyc
Ðазад
a ^�h� � @ s< d Z ddlZddlmZ ddlmZmZ G dd� de�ZdS ) z4Implements the functionality of an undirected graph.� N� )� DirectedGraph� )�NonexistentNodeError�NonexistentEdgeErrorc sH e Zd Zddd�Zd� fdd� Zdd� Zd d � Zd d � Zd d� Z� Z S )�UndirectedGraphNc C sF t � }t�| j�|_t�| j�|_| j|_| j|_| j|_| j|_|S )N) r �copy�deepcopy�nodes�edgesZ next_node_idZ next_edge_idZ _num_nodes� _num_edges)�self�memo�graph� r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/pygraph/classes/undirected_graph.py� __deepcopy__ s z UndirectedGraph.__deepcopy__r c s, t t| ��|||�}| j| d �|� |S )zoAdds a new, undirected edge between node_a and node_b with a cost. Returns the edge id of the new edge.r )�superr �new_edger �append)r �node_a�node_bZcost�edge_id�� __class__r r r s zUndirectedGraph.new_edgec sj � � |�}g }� fdd�|d D �D ] \}}|�|� |�|� q$t|�}||v r\|�|� dd� |D �S )zsFind all the nodes where there is an edge from the specified node to that node. Returns a list of node ids.c s g | ]}� � |�d �qS )�vertices��get_edge��.0r �r r r � <listcomp> � z-UndirectedGraph.neighbors.<locals>.<listcomp>r c S s g | ]}|�qS r r )r �nidr r r r! & r" )�get_noder �set�remove)r Znode_id�nodeZflattened_nodes_list�a�bZnode_setr r r � neighbors s zUndirectedGraph.neighborsc C sl | � |�}|d d }| �|�}|d �|� |d d }| �|�}|d �|� | j|= | jd8 _dS )z8Removes the edge identified by "edge_id" from the graph.r r r r N)r r$ r& r r )r r �edgeZ from_node_idZ from_nodeZ to_node_idZto_noder r r �delete_edge_by_id( s z!UndirectedGraph.delete_edge_by_idc C sb | � |�}|d d }| �|�}|d �|� |}| �|�}|d �|� |d d |f|d< dS )z(Moves an edge so that it targets node_a.r r r r N)r r$ r& r )r r r r+ Zoriginal_target_node_idZoriginal_target_nodeZnew_target_node_idZnew_target_noder r r �move_edge_target@ s z UndirectedGraph.move_edge_targetc s2 �� |� �sg S ��|�}� �fdd�|d D �S )z7Returns a list of edge ids connecting node_a to node_b.c s< g | ]4}�� |�d d � ks4�� |�d d � kr|�qS )r r r r r �r r r r r! Z s ,�z<UndirectedGraph.get_edge_ids_by_node_ids.<locals>.<listcomp>r )Zadjacentr$ )r r r r' r r. r �get_edge_ids_by_node_idsR s z(UndirectedGraph.get_edge_ids_by_node_ids)N)r ) �__name__� __module__� __qualname__r r r* r, r- r/ � __classcell__r r r r r s r )�__doc__r Zdirected_graphr � exceptionsr r r r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка