e% ^ S SK Jr SS/rSrSr " S S5 r " S S\5 r " S S5 rg
) ) GenericAliasTopologicalSorter
CycleErrorc \ rS rSrSrS rSrg) _NodeInfo node
npredecessors
successorsc , Xl SU l / U l g Nr r )selfr s ./opt/imh/python3.13/lib/python3.13/graphlib.py__init___NodeInfo.__init__ s
N)__name__
__module__ __qualname____firstlineno__ __slots__r __static_attributes__ r r r r s 5I r r c \ rS rSrSrSrg)r a# Subclass of ValueError raised by TopologicalSorter.prepare if cycles
exist in the working graph.
If multiple cycles exist, only one undefined choice among them will be reported
and included in the exception. The detected cycle can be accessed via the second
element in the *args* attribute of the exception instance and consists in a list
of nodes, such that each node is, in the graph, an immediate predecessor of the
next node in the list. In the reported list, the first and the last node will be
the same, to make it clear that it is cyclic.
r N)r r r r __doc__r r r r r r s r c h \ rS rSrSrSS jrS rS rS rS r S r
S
r S r S r
S
r\" \5 rSrg)r ) zFProvides functionality to topologically sort a graph of hashable nodesNc 0 U l S U l SU l SU l Ub- UR 5 H u p#U R
" U/UQ76 M g g r )
_node2info _ready_nodes _npassedout
_nfinisheditemsadd)r graphr predecessorss r r TopologicalSorter.__init__, sO &+kkm"- - '4 r c v U R R U5 =nc [ U5 =U R U' nU$ N)r# getr )r r results r
_get_nodeinfo TopologicalSorter._get_nodeinfo6 s8 oo))$/ /F 8-6t_