daf* ddldeedeeeefdeeefdZdeeeeeefdeeeefdZdeeeefd eed edee efd Z y ) )*verticesedgesreturnc#Ktgigdtdtttffd |D]}|vs|Ed{y7w)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-strongly-connected-components-of-a-directed-graph/. vrc3Kt|<j|j||D]D}|vr|Ed{|vs|dks)j|dkrFd|k(r?jt|d}|d=j ||yy7w)N)lenappendpopsetupdate) rwscc boundariesdfsr identifiedindexstacks 9/root/Python-3.12.4/Tools/peg_generator/pegen/sccutils.pyrz*strongly_connected_components..dfssu:a Q%(#q %A~q6!!*$AhB/NN$AhB/  % b>U1X % NN eE!HJ'(CeAhj!   c "I & "s%A CC C C%CACN)rstrIteratorSet)rrrrrrrrs ` @@@@@rstrongly_connected_componentsrsh"5JEEJsxC)& E>1v   s?A AAAdatac#K|jD]\}}|j|tj|j t|j z D]}t||< |jDchc] \}}|r | }}}|sn0||jDcic]\}}||vs |||z }}}X|r Jd|zycc}}wcc}}ww)a`Topological sort. Args: data: A map from SCCs (represented as frozen sets of strings) to sets of SCCs, its dependencies. 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 SCCs that have an equivalent ordering. NOTE: The algorithm doesn't care about the internal structure of SCCs. 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-topological-sort/history/1/. z%A cyclic dependency exists amongst %rN)itemsdiscardrunionvalueskeys)rkritemdepreadys rtopsortr'4sF 1 !  4;;=)C ,<<UT  '+zz|?)$3??  59ZZ\W cTQVEVsU{"WW  C B -> C -> A. The first item is always the start argument, but the last item may be another element, e.g. ['A', 'B', 'C', 'B'] means there's a path from A to B and there's a cycle from B to C and back. nodepathrc3nK||vr ||gzy||gz}|D]}||Ed{y7w)N)r+r,childrr(s rrzfind_cycles_in_scc..dfsxsN 4<$-  tf}4[ (E5$' ' ' ( 's (535N)r"rrListr)r(rr)srcdstsdstrs` @rfind_cycles_in_sccr4ds C<%%%< %**, 2ejjl 22 HM{{} c c)#tX[_bXbS$53#*35 5 cE E>>(#(T#Y(8DI+>(5"~6 csCA C CC# C-C1C6AC;C <CCCN) typing AbstractSetrDictrrrIterabler'r0r4r.rr:s+#+'+CS1A,A'B+ k#+\-D {3[%5!66 7-D k+c*+,-D` [%% &-8-=FI d3ir9