Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pygraph/classes/__pycache__/directed_graph.cpython-39.pyc
Ðазад
a ^�h� � @ s0 d Z ddlZddlmZmZ G dd� de�ZdS )z1Implements the functionality of a directed graph.� N� )�NonexistentNodeError�NonexistentEdgeErrorc @ s� e Zd ZdZdZdZdZdd� Zd3dd�Zdd� Z d d � Z d d � Z d d� Z dd� Z d4dd�Zdd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� Z d/d0� Z d1d2� Z dS )5� DirectedGraphN� c C s i | _ i | _d| _d| _d S )Nr )�nodes�edges� _num_nodes� _num_edges��self� r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/pygraph/classes/directed_graph.py�__init__ s zDirectedGraph.__init__c C sF t � }t�| j�|_t�| j�|_| j|_| j|_| j|_| j|_|S )N) r �copy�deepcopyr r � next_node_id� next_edge_idr r )r �memo�graphr r r � __deepcopy__ s zDirectedGraph.__deepcopy__c C s | j S )z1Returns the current number of nodes in the graph.)r r r r r � num_nodes s zDirectedGraph.num_nodesc C s | j S )z1Returns the current number of edges in the graph.)r r r r r � num_edges" s zDirectedGraph.num_edgesc C s | j }| j d7 _ |S �Nr )r )r �node_idr r r �generate_node_id& s z DirectedGraph.generate_node_idc C s | j }| j d7 _ |S r )r )r �edge_idr r r �generate_edge_id+ s z DirectedGraph.generate_edge_idc C s0 | � � }|g i d�}|| j|< | jd7 _|S )zQAdds a new, blank node to the graph. Returns the node id of the new node.)�idr �datar )r r r �r r �noder r r �new_node0 s � zDirectedGraph.new_nodec C s� z| j | W n ty( t|��Y n0 z| j | W n tyR t|��Y n0 | �� }|||f|i d�}|| j|< | j | d �|� | jd7 _|S )zcAdds a new edge from node_a to node_b that has a cost. Returns the edge id of the new edge.)r �vertices�costr r r )r �KeyErrorr r r �appendr )r �node_a�node_br$ r �edger r r �new_edge@ s$ � zDirectedGraph.new_edgec s � � |�}� fdd�|d 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 d �qS �r# r ��get_edge��.0r r r r � <listcomp>b � z+DirectedGraph.neighbors.<locals>.<listcomp>r )�get_noder r r r � neighbors^ s zDirectedGraph.neighborsc C s | � |�}||v S )z�Determines whether there is an edge from node_a to node_b. Returns True if such an edge exists, otherwise returns False.)r3 )r r' r( r3 r r r �adjacentd s zDirectedGraph.adjacentc C sN t d�}| �|�}|d D ].}| �|�}||f}|d |kr|d } qJq|S )zxReturns the cost of moving between the edge that connects node_a to node_b. Returns +inf if no such edge exists.�infr r# r$ )�floatr2 r- )r r' r( r$ Z node_object_ar r) Ztplr r r � edge_costj s zDirectedGraph.edge_costc C s. z| j | }W n ty( t|��Y n0 |S )z0Returns the node object identified by "node_id".)r r% r )r r Z node_objectr r r r2 w s zDirectedGraph.get_nodec C s t | j�� �S )z0Returns a list of all the node ids in the graph.)�listr �keysr r r r �get_all_node_ids s z DirectedGraph.get_all_node_idsc C s t | j�� �S )z4Returns a list of all the node objects in the graph.)r8 r �valuesr r r r �get_all_node_objects� s z"DirectedGraph.get_all_node_objectsc C s. z| j | }W n ty( t|��Y n0 |S )z0Returns the edge object identified by "edge_id".)r r% r )r r Z edge_objectr r r r- � s zDirectedGraph.get_edgec C s t | j�� �S )z/Returns a list of all the edge ids in the graph)r8 r r9 r r r r �get_all_edge_ids� s z DirectedGraph.get_all_edge_idsc C s t | j�� �S )z4Returns a list of all the edge objects in the graph.)r8 r r; r r r r �get_all_edge_objects� s z"DirectedGraph.get_all_edge_objectsc C sH | � |�}|d d }| �|�}|d �|� | j|= | jd8 _dS )z8Removes the edge identified by "edge_id" from the graph.r# r r r N)r- r2 �remover r )r r r) Z from_node_idZ from_noder r r �delete_edge_by_id� s z DirectedGraph.delete_edge_by_idc C sX | � |�}g }|d D ](}| �|�}|d d |kr|�|� q|D ]}| �|� qDdS )z;Removes all the edges from node_a to node_b from the graph.r r# r N)r2 r- r& r@ )r r' r( r! Zedge_idsZe_idr) �er r r �delete_edge_by_nodes� s z"DirectedGraph.delete_edge_by_nodesc sl | � � �}|d D ]}| �|� q� fdd�t| j�� �D �}|D ]}| �|� qB| j� = | jd8 _dS )z6Removes the node identified by node_id from the graph.r c s$ g | ] \}}|d d � kr|�qS r+ r )r/ r r) �r r r r0 � r1 z-DirectedGraph.delete_node.<locals>.<listcomp>r N)r2 r@ r8 r �itemsr r )r r r! rA r r rC r � delete_node� s zDirectedGraph.delete_nodec C sR | � |�}||d d f|d< | �|�}|d �|� | �|�}|d �|� dS )zHMoves an edge originating from node_a so that it originates from node_b.r# r r N)r- r2 r? r& )r r r' r( r) r! r r r �move_edge_source� s z DirectedGraph.move_edge_sourcec C s" | � |�}|d d |f|d< dS )z(Moves an edge so that it targets node_a.r# r Nr, )r r r' r) r r r �move_edge_target� s z DirectedGraph.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 | ] }�� |�d d � kr|�qS r+ r, r. �r( r r r r0 � r1 z:DirectedGraph.get_edge_ids_by_node_ids.<locals>.<listcomp>r )r4 r2 )r r' r( r! r rH r �get_edge_ids_by_node_ids� s z&DirectedGraph.get_edge_ids_by_node_idsc C s | � ||�}|sdS |d S dS )zHReturns the first (and possibly only) edge connecting node_a and node_b.Nr )rI )r r' r( �retr r r � get_first_edge_id_by_node_ids� s z+DirectedGraph.get_first_edge_id_by_node_ids)N)r ) �__name__� __module__� __qualname__r r r r r r r r r r r" r* r3 r4 r7 r2 r: r< r- r= r> r@ rB rE rF rG rI rK r r r r r s8 r )�__doc__r � exceptionsr r �objectr r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка