Χg<ddlmZddlmZmZGddZdS))deque)ListSetceZdZdZdZdZdZdZdZe dZ e dZ d Z d Z d ed eefd Zd ed eefdZd edefdZded eefdZd efdZdS)DiGraphzReally simple unweighted directed graph data structure to track dependencies. The API is pretty much the same as networkx so if you add something just copy their API. cLi|_i|_i|_i|_d|_dS)Nr)_node_succ_pred _node_order_insertion_idxselfs R/var/www/html/ai-engine/env/lib/python3.11/site-packages/torch/package/_digraph.py__init__zDiGraph.__init__ s1   c ||jvr?||j|<i|j|<i|j|<|j|j|<|xjdz c_dS|j||dS)zAdd a node to the graph. Args: n: the node. Can we any object that is a valid dict key. **kwargs: any attributes you want to attach to the node. N)r r r r r update)rnkwargss radd_nodezDiGraph.add_nodes| DJ  "DJqMDJqMDJqM"&"5D Q    1 $     JqM  ( ( ( ( (rc||||d|j||<d|j||<dS)zAdd an edge to graph between nodes ``u`` and ``v`` ``u`` and ``v`` will be created if they do not already exist. TN)rr r )ruvs radd_edgezDiGraph.add_edge+sP a a  1 a 1 arc t|j|S#t$r}td|d|d}~wwxYw)z.Returns an iterator over successor nodes of n. The node  is not in the digraph.N)iterr KeyError ValueErrorrres r successorszDiGraph.successors8[ L 1 && & L L LCCCCDD! K L ?:?c t|j|S#t$r}td|d|d}~wwxYw)z1Returns an iterator over predecessors nodes of n.rrN)r r r!r"r#s r predecessorszDiGraph.predecessors?r&r'c#^K|jD]\}}|D]}||fV dS)z6Returns an iterator over all edges (u, v) in the graphN)r items)rrr%succs redgesz DiGraph.edgesFsV"Z--//  MAz"  g    rc|jS)z6Returns a dictionary of all nodes to their attributes.)r rs rnodesz DiGraph.nodesMs zrc*t|jS)zIterate over the nodes.)r r rs r__iter__zDiGraph.__iter__RsDJrc8 ||jvS#t$rYdSwxYw)z>Returns True if ``n`` is a node in the graph, False otherwise.F)r TypeError)rrs r __contains__zDiGraph.__contains__Vs5  ? "   55 s  srcreturncBt|}t|}t|dkrm|}||D]0}||vr*||||1t|dkm|S)z2Returns a set of nodes that are reachable from srcr)setrlenpopleftr%addappendrr5result working_setcurrs rforward_transitive_closurez"DiGraph.forward_transitive_closure]sSCjj +""%%''C__S)) * *F??JJqMMM&&q))) +""  rcBt|}t|}t|dkrm|}||D]0}||vr*||||1t|dkm|S)zGReturns a set of nodes that are reachable from src in reverse directionr)r8rr9r:r)r;r<r=s rbackward_transitive_closurez#DiGraph.backward_transitive_closurejsSCjj +""%%''C&&s++ * *F??JJqMMM&&q))) +""  rdstct}||}||vr|St|}t|dkrn|}||D]1}||vr+|||||2t|dkn|S)zAReturns a subgraph rooted at src that shows all the paths to dst.r) rrArr9r:r)rr<to_dot)rr5rD result_graphforward_reachable_from_srcr?r@rs r all_pathszDiGraph.all_pathswsyy %)%D%DS%I%I" 0 0 0  Cjj +""%%''C&&s++ * *222 ))!S111&&q))) +""""$$$rcg}|rk|||j|}d\}}|D]-}|j|d}|n |||kr|}|}.|kt t |S)z_Returns a list of nodes that show the first path that resulted in dst being added to the graph.)NN)r<r keysr getlistreversed)rrDpath candidatesmin_idx candidateidxs r first_pathzDiGraph.first_paths $ KK   C--//J#LC' $ $ &**9d;;;E?cGmm!G#C $HTNN###rcVdd|jD}d|dS)zvReturns the dot representation of the graph. Returns: A dot representation of the graph.  c3.K|]\}}d|d|dVdS)"z" -> "z";N).0fts r z!DiGraph.to_dot..s:DDA,a,,q,,,DDDDDDrz,digraph G { rankdir = LR; node [shape=box]; z } )joinr-)rr-s rrFzDiGraph.to_dotsD  DDDDDDD  rN)__name__ __module__ __qualname____doc__rrrr%r)propertyr-r/r1r4strrrArCrIrrUrFrZrrrrsr    )))    LLLLLLX X    c c#h     s s3x    %S%s%%%%0$c$d3i$$$$$       rrN) collectionsrtypingrrrrZrrrhskhhhhhhhhhhr