OwlCyberSecurity - MANAGER
Edit File: topological_sort.cpython-39.pyc
a ���e � @ s$ G d d� de �Zdd� Zdd� ZdS )c @ s e Zd ZdS )�CyclicDependencyErrorN)�__name__� __module__� __qualname__� r r �^/home/gouroczh/virtualenv/pat/3.9/lib/python3.9/site-packages/django/utils/topological_sort.pyr s r c # sf | � � }|rbdd� |�� D �� � sDtd�d�dd� |�� D ������ V � fdd�|�� D �}qd S ) ag Variation of Kahn's algorithm (1962) that returns sets. Take a dependency graph as a dictionary of node => dependencies. Yield sets of items in topological order, where the first set contains all nodes without dependencies, and each following set contains all nodes that may depend on the nodes only in the previously yielded sets. c S s h | ]\}}|s|�qS r r )�.0�node�depsr r r � <setcomp> � z+topological_sort_as_sets.<locals>.<setcomp>z Cyclic dependency in graph: {}z, c s s | ]}t |�V qd S �N)�repr)r �xr r r � <genexpr> r z+topological_sort_as_sets.<locals>.<genexpr>c s" i | ]\}}|� vr||� �qS r r )r r � dependencies��currentr r � <dictcomp> s �z,topological_sort_as_sets.<locals>.<dictcomp>N)�copy�itemsr �format�join)�dependency_graph�todor r r �topological_sort_as_sets s �� �r c C s2 g }t |�D ] }| D ]}||v r|�|� qq |S r )r �append)�nodesr �result�layerr r r r �stable_topological_sort$ s r N)� ValueErrorr r r r r r r �<module> s