B ��Re��@sGdd�de�ZdS)c@speZdZdZdd�Zdd�Zdd�Zdd �Zd d�Zdd �Z dd�Z dd�Zdd�Zdd�Z dd�Zdd�ZdS)� DirectedGraphz+A graph structure with directed edges. cCst�|_i|_i|_dS)N)�set� _vertices� _forwards� _backwards)�self�r��/builddir/build/BUILDROOT/alt-python37-pip-20.2.4-6.el8.x86_64/opt/alt/python37/lib/python3.7/site-packages/pip/_vendor/resolvelib/structs.py�__init__szDirectedGraph.__init__cCs t|j�S)N)�iterr)rrrr�__iter__ szDirectedGraph.__iter__cCs t|j�S)N)�lenr)rrrr�__len__ szDirectedGraph.__len__cCs ||jkS)N)r)r�keyrrr�__contains__szDirectedGraph.__contains__cCsBt�}t|j�|_dd�|j��D�|_dd�|j��D�|_|S)z-Return a shallow copy of this graph. cSsi|]\}}t|�|�qSr)r)�.0�k�vrrr� sz&DirectedGraph.copy..cSsi|]\}}t|�|�qSr)r)rrrrrrrs)rrrr�itemsr)r�otherrrr�copys zDirectedGraph.copycCs:||jkrtd��|j�|�t�|j|<t�|j|<dS)z'Add a new vertex to the graph. z vertex existsN)r� ValueError�addrrr)rrrrrrs zDirectedGraph.addcCs\|j�|�x$|j�|�D]}|j|�|�qWx$|j�|�D]}|j|�|�q@WdS)zLRemove a vertex from the graph, disconnecting all edges from/to it. N)r�remover�popr)rr�f�trrrr%s zDirectedGraph.removecCs||j|ko||j|kS)N)rr)rrrrrr� connected.szDirectedGraph.connectedcCs6||jkrt|��|j|�|�|j|�|�dS)zgConnect two existing vertices. Nothing happens if the vertices are already connected. N)r�KeyErrorrrr)rrrrrr�connect1s zDirectedGraph.connectccs4x.|j��D] \}}x|D]}||fVqWqWdS)N)rr)rr�childrenrrrr� iter_edges;s zDirectedGraph.iter_edgescCst|j|�S)N)r r)rrrrr� iter_children@szDirectedGraph.iter_childrencCst|j|�S)N)r r)rrrrr�iter_parentsCszDirectedGraph.iter_parentsN)�__name__� __module__�__qualname__�__doc__r rr rrrrrrr!r"r#rrrrrs rN)�objectrrrrr��