File: //usr/lib/python3.9/site-packages/ipapython/__pycache__/graph.cpython-39.opt-1.pyc
a
}�f� � @ s d dl mZ G dd� d�ZdS )� )�dequec @ sR e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
ddd�Z dS )�Graphz�
Simple oriented graph structure
G = (V, E) where G is graph, V set of vertices and E list of edges.
E = (tail, head) where tail and head are vertices
c C s t � | _g | _t� | _d S �N)�set�vertices�edges�dict�_adj)�self� r �3/usr/lib/python3.9/site-packages/ipapython/graph.py�__init__ s zGraph.__init__c C s | j �|� g | j|< d S r )r �addr )r
�vertexr r r �
add_vertex s zGraph.add_vertexc C sH || j vrtd��|| j vr$td��| j�||f� | j| �|� d S )Nztail is not a vertexzhead is not a vertex)r �
ValueErrorr �appendr �r
�tail�headr r r �add_edge s
zGraph.add_edgec C sL z| j �||f� W n" ty6 td�||���Y n0 | j| �|� d S )Nz'graph does not contain edge: ({0}, {1}))r �remove�KeyErrorr �formatr r r r r � remove_edge" s
�
zGraph.remove_edgec s~ z| j �� � W n ty0 td�� ���Y n0 | j� = | j�� D ] }� fdd�|D �|d d �< qD� fdd�| jD �| _d S )Nz"graph does not contain vertex: {0}c s g | ]}|� kr|�qS r r )�.0�v�r r r �
<listcomp>6 � z'Graph.remove_vertex.<locals>.<listcomp>c s$ g | ] }� |d |d fvr|�qS �r � r �r �er r r r 9 s )r r r r r r �valuesr )r
r Zadjr r r �
remove_vertex+ s �
�zGraph.remove_vertexc s � fdd�| j D �S )zU
Get list of vertices where a vertex is on the right side of an edge
c s g | ]}|d � kr|d �qS )r! r r r" �r r r r A r z#Graph.get_tails.<locals>.<listcomp>�r )r
r r r& r � get_tails= s zGraph.get_tailsc s � fdd�| j D �S )zT
Get list of vertices where a vertex is on the left side of an edge
c s g | ]}|d � kr|d �qS r r r" �r r r r G r z#Graph.get_heads.<locals>.<listcomp>r' )r
r r r) r � get_headsC s zGraph.get_headsNc C sb |st t| j��}t� }t|g�}|r^|�� }||vr"|�|� |�t| j� |g ��| � q"|S )z
Breadth-first search traversal of the graph from `start` vertex.
Return a set of all visited vertices
)
�next�iterr r r �popleftr �extendr �get)r
�startZvisitedZqueuer r r r �bfsI s
z Graph.bfs)N) �__name__�
__module__� __qualname__�__doc__r
r r r r% r( r* r1 r r r r r s
r N)� collectionsr r r r r r �<module> s