3
Reเ ใ @ s G d d de ZdS )c @ sp e Zd ZdZdd Zdd Zdd Zdd Zd
d Zd d
Z dd Z
dd Z dd Z dd Z
dd Zdd ZdS )ฺ
DirectedGraphz+A graph structure with directed edges.
c C s t | _i | _i | _d S )N)ฺsetฺ _verticesฺ _forwardsฺ
_backwards)ฺselfฉ r ๚/builddir/build/BUILDROOT/alt-python36-pip-20.2.4-5.el9.x86_64/opt/alt/python36/lib/python3.6/site-packages/pip/_vendor/resolvelib/structs.pyฺ__init__ s zDirectedGraph.__init__c C s
t | jS )N)ฺiterr )r r r r ฺ__iter__
s zDirectedGraph.__iter__c C s
t | jS )N)ฺlenr )r r r r ฺ__len__
s zDirectedGraph.__len__c C s
|| j kS )N)r )r ฺkeyr r r ฺ __contains__ s zDirectedGraph.__contains__c C sB t }t| j|_dd | jj D |_dd | jj D |_|S )z-Return a shallow copy of this graph.
c S s i | ]\}}t ||qS r )r )ฺ.0ฺkฺvr r r ๚
s z&DirectedGraph.copy..c S s i | ]\}}t ||qS r )r )r r r r r r r s )r r r r ฺitemsr )r ฺotherr r r ฺcopy s
zDirectedGraph.copyc C s: || j krtd| j j| t | j|< t | j|< dS )z'Add a new vertex to the graph.
z
vertex existsN)r ฺ
ValueErrorฺaddr r r )r r r r r r s
zDirectedGraph.addc C s\ | j j| x$| jj|D ]}| j| j| qW x$| jj|D ]}| j| j| q@W dS )zLRemove a vertex from the graph, disconnecting all edges from/to it.
N)r ฺremover ฺpopr )r r ฺfฺtr r r r % s
zDirectedGraph.removec C s || j | ko|| j| kS )N)r r )r r r r r r ฺ connected. s zDirectedGraph.connectedc C s6 || j krt|| j| j| | j| j| dS )zgConnect two existing vertices.
Nothing happens if the vertices are already connected.
N)r ฺKeyErrorr r r )r r r r r r ฺconnect1 s
zDirectedGraph.connectc c s4 x.| j j D ] \}}x|D ]}||fV qW q W d S )N)r r )r r ฺchildrenr r r r ฺ
iter_edges; s
zDirectedGraph.iter_edgesc C s t | j| S )N)r
r )r r r r r ฺ
iter_children@ s zDirectedGraph.iter_childrenc C s t | j| S )N)r
r )r r r r r ฺ iter_parentsC s zDirectedGraph.iter_parentsN)ฺ__name__ฺ
__module__ฺ __qualname__ฺ__doc__r r r
r r r r r r r! r" r# r r r r r s
r N)ฺobjectr r r r r ฺ s