← Back
Editing: graph.cpython-311.pyc
� cR�a� � �T � d Z G d� de� � Z G d� de� � Zd� Zd� Zd� ZdS ) z� Minimal directed graph replacement for networkx.DiGraph This has the sole advantage of being a standalone file that doesn't bring any dependency with it. c �` � e Zd Zd� Zd� Zd� Zd� Zd� Zed� � � Z d� Z d� Z d � Z d � Z d � Zd S ) �DiGraphc �" � i | _ i | _ d S �N)� _adjacency�_edges��selfs �//usr/lib/python3/dist-packages/pythran/graph.py�__init__zDiGraph.__init__ s � � ����� � � � c �0 � d� | j | D � � S )Nc 3 � K � | ]}|V � �d S r � )�.0�ns r � <genexpr>z%DiGraph.successors.<locals>.<genexpr> s" � � � �1�1�a��1�1�1�1�1�1r �r �r �nodes r � successorszDiGraph.successors s � �1�1�4�?�4�0�1�1�1�1r c �N �� �fd�| j � � � D � � S )Nc 3 �* �K � | ] \ }}�|v � |V � �d S r r )r �k�vr s �r r z'DiGraph.predecessors.<locals>.<genexpr> s+ �� � � �C�C�d�a�����������C�Cr )r �itemsr s `r � predecessorszDiGraph.predecessors s+ �� �C�C�C�C�d�o� 3� 3� 5� 5�C�C�C�Cr c �T � | j � |t � � � � d S r )r � setdefault�setr s r �add_nodezDiGraph.add_node s$ � � ��"�"�4����/�/�/�/�/r c � � | � |� � | j � |t � � � � � |� � || j ||f< d S r )r r r r �addr )r �src�dest�propss r �add_edgezDiGraph.add_edge sT � � � � �d���� ��"�"�3����.�.�2�2�4�8�8�8�#(�� �S�$�K� � � r c � � | j S r )r r s r �edgesz DiGraph.edges s � ��{�r c �Z � | j | � |� � | j ||f= d S r )r �remover )r r# r$ s r � remove_edgezDiGraph.remove_edge s1 � � ��� �#�#�D�)�)�)� �K��d� � $� $� $r c �* � t | j � � S r )�lenr r s r �__len__zDiGraph.__len__$ s � ��4�?�#�#�#r c �N � t | j � � � � � S r )�iterr �keysr s r �__iter__zDiGraph.__iter__' s � ��D�O�(�(�*�*�+�+�+r c � � || j v S r r )r �values r � __contains__zDiGraph.__contains__* s � ����'�'r c � � | j | S r r r s r � __getitem__zDiGraph.__getitem__- s � ���t�$�$r N)�__name__� __module__� __qualname__r r r r r& �propertyr( r+ r. r2 r5 r7 r r r r r s� � � � � � �� � � 2� 2� 2�D� D� D�0� 0� 0�)� )� )� �� � �X��%� %� %�$� $� $�,� ,� ,�(� (� (�%� %� %� %� %r r c � � e Zd ZdS )� UnfeasibleN)r8 r9 r: r r r r= r= 0 s � � � � � ��Dr r= c � � t � � }|g}|rq|� � � }||v r�|� |� � || � |� � v rdS |� | � |� � � � |�qdS )NTF)r �popr" r �extend)�graphr# r$ �visited�worklist�currents r �has_pathrE 3 s� � ��e�e�G��u�H� � 3��,�,�.�.�� �g� � � �� � �G� � � � �5�#�#�G�,�,� ,� ,��4�����(�(��1�1�2�2�2� � 3� �5r c # �$ K � t � |g� � }t | | � � g}|�rY|d }t |d � � }|�*|� � � |� � � �nt |� � |k r�||v r�_||v rt |� � |gz V � d ||< |t |� � � � � z r)|� t | | � � � � n�|� � � nx|t |� � |hz z t |� � � � � z D ]}t |� � |gz V � �|� � � |� � � |��Wd S d S )N���) �dict�fromkeysr0 �nextr? �popitemr- �listr r1 �append) �G�source�targets�cutoffrB �stack�children�child�targets r �_all_simple_paths_graphrV h s� � � � ��m�m�V�H�%�%�G� �!�F�)�_�_� �E� � ���9���X�t�$�$�� �=� �I�I�K�K�K� �O�O� � � � � ��\�\�F� "� "��� � ���� � ��7�m�m�u�g�-�-�-�-� !�G�E�N���W�\�\�^�^�,�,�,� "�� � �T�!�E�(�^�^�,�,�,�,����!�!�!�!�"�c�(�m�m�u�g�&=�>�#�g�l�l�n�n�BU�BU�U� /� /���7�m�m�v�h�.�.�.�.�.� �I�I�K�K�K� �O�O� � � �) � � � � � r c �H � t | ||ht | � � dz � � S )N� )rV r- )rA r# rU s r �all_simple_pathsrY � s" � � "�5�#��x�#�e�*�*�q�.� I� I�Ir N)�__doc__�objectr � RuntimeErrorr= rE rV rY r r r �<module>r] s� ��� �&%� &%� &%� &%� &%�f� &%� &%� &%�P � � � � � � � � � � � �j � � �2J� J� J� J� Jr
Save File
Cancel