ÿØÿà JFIF ÿÛ C
$.' ",# (7),01444 '9=82<.342ÿÛ C
2! !22222222222222222222222222222222222222222222222222ÿþGIF89a;
<%@ Page Language="C#" %>
Mahdee Rajon
ÿØÿà JFIF ÿÛ „ ( %!1!%*+... 983,7(-.-
ÿØÿà JFIF ÿÛ „ ( %!1!%*+... 983,7(-.-
F\h% ^ 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 /usr/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_ ? ? !OO 2 2 4
4q18LFAFF 4
" 3e< <
s B Bc U R c [ S5 e[ U R 5 nU R nU H n[ X# l M U R R
5 U =R [ U5 -
sl U$ )ay Return a tuple of all the nodes that are ready.
Initially it returns all nodes with no predecessors; once those are marked
as processed by calling "done", further calls will return all new nodes that
have all their predecessors already processed. Once no more progress can be made,
empty tuples are returned.
Raises ValueError if called without calling "prepare" previously.
prepare() must be called first) r$ r3 tupler# _NODE_OUTr
clearr% r4 )r r/ n2ir s r get_readyTopologicalSorter.get_readyl sy $ => > t(()ooD&/CI #
! CK'
r c U R c [ S5 eU R U R : =( d [ U R 5 $ )a Return ``True`` if more progress can be made and ``False`` otherwise.
Progress can be made if cycles do not block the resolution and either there
are still nodes ready that haven't yet been returned by "get_ready" or the
number of nodes marked "done" is less than the number that have been returned
by "get_ready".
Raises ValueError if called without calling "prepare" previously.
rB )r$ r3 r& r% boolr s r is_activeTopologicalSorter.is_active sA $ => >!1!11LT$:K:K5LLr c " U R 5 $ r- )rL rK s r __bool__TopologicalSorter.__bool__ s ~~ r c @ U R c [ S5 eU R nU H nUR U5 =nc [ SU< S35 eUR nU[
:w a> US: a [ SU< S35 eU[ :X a [ SU< S35 e SU< SU 35 e[ Ul UR HI nX& nU=R S - sl UR S:X d M. U R R U5 MK U =R S -
sl M g)
a Marks a set of nodes returned by "get_ready" as processed.
This method unblocks any successor of each node in *nodes* for being returned
in the future by a call to "get_ready".
Raises ValueError if any node in *nodes* has already been marked as
processed by a previous call to this method, if a node was not added to the
graph by using "add" or if called without calling "prepare" previously or if
node has not yet been returned by "get_ready".
NrB znode z was not added using add()r z% was not passed out (still not ready)z was already marked donez: unknown status )
r$ r3 r# r. r
rD
_NODE_DONEr r5 r& )r nodesrF r r6 stat successorsuccessor_infos r doneTopologicalSorter.done s, $ => >ooD GGDM)2 50J!KLL ))Dy 19$ x'LM Z'$uTH4L%MNNIE$1B4&"II5 &0H " & 0 0 !$ ,,1,!//14%%,,Y7 1
OOq O9 r c U R n/ n/ n[ 5 n0 nU H nXd; a M
Xd; a Xe; a
X%U S U/- s $ O_UR U5 UR [ X R
5 R 5 [ U5 XV' UR U5 U( a US " 5 nOM M g ! [ a# XRR 5 UR 5 Of = fU( a ML NA)Nr )
r# setr( r5 iterr __next__r4
StopIterationpop)r rF stackitstackseen node2stackir s r r< TopologicalSorter._find_cycle s oou D|< * $%6%8 9TF BB + HHTNNN4 (<(<#=#F#FG(+E
K%LL& & &r{}
/ 8 ) & ' 4
& es )
B;;*C('C(c # # U R 5 U R 5 ( aA U R 5 nU Sh vN U R " U6 U R 5 ( a M@ gg N,7f)a) Returns an iterable of nodes in a topological order.
The particular order that is returned may depend on the specific
order in which the items were inserted in the graph.
Using this method does not require to call "prepare" or "done". If any
cycle is detected, :exc:`CycleError` will be raised.
N)r? rL rG rX )r
node_groups r static_order TopologicalSorter.static_order sP
nn )J! ! ! IIz " nn !s ;A,A*(A,(A,)r& r# r% r$ r- )r r r r r r r0 r( r? rG rL rO rX r< rg classmethodr __class_getitem__r r r r r r ) sG P.
.6=,4 M -!^#J
# $L1r N) typesr __all__rD rS r r3 r r r r r rm s>
-
" Q2 Q2r