X-Phv ddZddlmZddlmZmZmZddlm Z e dZ dd Z ddZ ddZ dS)z&Helpers for manipulations with graphs.) annotations)IterableIteratorSet)TypeVarTverticesAbstractSet[T]edgesdict[T, list[T]]returnIterator[set[T]]c#Ktgigdfd |D]}|vr|Ed{VdS)aCompute Strongly Connected Components of a directed graph. Args: vertices: the labels for the vertices edges: for each vertex, gives the target vertices of its outgoing edges Returns: An iterator yielding strongly connected components, each represented as a set of vertices. Each input vertex will occur exactly once; vertices not part of a SCC are returned as singleton sets. From https://code.activestate.com/recipes/578507/. vrr rc3Kt|<|||D]T}|vr|Ed{V|vr8|dkr&|dk&Ud|krWt|d}|d=||VdSdS)N)lenappendpopsetupdate) rwscc boundariesdfsr identifiedindexstacks P/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/mypy/graph_utils.pyrz*strongly_connected_components..dfs!s8u::a Q%(###q % %A~~3q66!!!!!!!!*$$AhB//NN$$$AhB// b>U1X % % NN   eE!HJJ'((CeAhjj!   c " " "IIIII & %N)rrr r)r)r r rrrrrrs ` @@@@@rstrongly_connected_componentsr! s"JEEJ& E>>s1vv       r sccs list[set[T]])dict[AbstractSet[T], set[AbstractSet[T]]]ci|D]}t|}|D]}||<i}|D]N}t}|D])}|fd||D*||t|<O|S)zLUse original edges to organize SCCs in a graph by dependencies between them.c3(K|] }|V dS)N).0xsccsmaps r zprepare_sccs..Fs'55q 555555r ) frozensetrr)r"r r scc_frozenrdatadepsr*s @r prepare_sccsr09sG$$s^^  $ $A#GAJJ $68D$$$'EE 6 6A KK5555E!H555 5 5 5 5#Ys^^ Kr r.dict[T, set[T]]Iterable[set[T]]c#K|D]\}}||tj|t|z D]}t||< d|Dsn%Vfd|D}F|r Jd|dS)aTopological sort. Args: data: A map from vertices to all vertices that it has an edge connecting it to. NOTE: This data structure is modified in place -- for normalization purposes, self-dependencies are removed and entries representing orphans are added. Returns: An iterator yielding sets of vertices that have an equivalent ordering. Example: Suppose the input has the following structure: {A: {B, C}, B: {D}, C: {D}} This is normalized to: {A: {B, C}, B: {D}, C: {D}, D: {}} The algorithm will yield the following values: {D} {B, C} {A} From https://code.activestate.com/recipes/577413/. Tch|] \}}|| Sr'r')r(itemdeps r ztopsort..ps!???)$3????r c*i|]\}}|v ||z Sr'r')r(r5r6readys r ztopsort..ts.WWW cTQVEVEVsU{EVEVEVr z#A cyclic dependency exists amongst N)itemsdiscardrunionvalueskeys)r.krr5r9s @rtopsortrAKs@ 1 !  4;;==)C ,<,<<UUT X??tzz||???   WWWWTZZ\\WWW X CCC4CCCCCCCr N)r r r r r r)r"r#r r r r$)r.r1r r2)__doc__ __future__rcollections.abcrrr AbstractSettypingrrr!r0rAr'r rrGs,,""""""BBBBBBBBBB GCLL++++\$*D*D*D*D*D*Dr