o i@s.ddlmZddlmZmZGdddZdS))deque)ListSetc@seZdZdZddZddZddZdd Zd d Ze d d Z e ddZ ddZ ddZ dedeefddZdedeefddZdedefddZdedeefddZdefdd Zd!S)"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. cCs"i|_i|_i|_i|_d|_dS)Nr)_node_succ_pred _node_order_insertion_idxselfr e/var/www/html/eduruby.in/lip-sync/lip-sync-env/lib/python3.10/site-packages/torch/package/_digraph.py__init__ s  zDiGraph.__init__cKsZ||jvr#||j|<i|j|<i|j|<|j|j|<|jd7_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)rrrr r update)r nkwargsr r radd_nodes     zDiGraph.add_nodecCs4||||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)rrr)r uvr r radd_edge*s  zDiGraph.add_edgec C<zt|j|WSty}z td|d|d}~ww)z.Returns an iterator over successor nodes of n. The node  is not in the digraph.N)iterrKeyError ValueErrorr rer r r successors7 zDiGraph.successorsc Cr)z1Returns an iterator over predecessors nodes of n.rrN)rrrrrr r r predecessors>r!zDiGraph.predecessorsccs.|jD]\}}|D]}||fVq qdS)z6Returns an iterator over all edges (u, v) in the graphN)ritems)r rr succr r redgesEs  z DiGraph.edgescCs|jS)z6Returns a dictionary of all nodes to their attributes.)rr r r rnodesLsz DiGraph.nodescCs t|jS)zIterate over the nodes.)rrr r r r__iter__Qs zDiGraph.__iter__cCs"z||jvWStyYdSw)z>Returns True if ``n`` is a node in the graph, False otherwise.F)r TypeError)r rr r r __contains__Us   zDiGraph.__contains__srcreturncC`t|}t|}t|dkr.|}||D]}||vr'||||qt|dks|S)z2Returns a set of nodes that are reachable from srcr)setrlenpopleftr addappendr r*result working_setcurrr r rforward_transitive_closure\    z"DiGraph.forward_transitive_closurecCr,)zGReturns a set of nodes that are reachable from src in reverse directionr)r-rr.r/r"r0r1r2r r rbackward_transitive_closureir7z#DiGraph.backward_transitive_closuredstcCszt}||}||vr|St|}t|dkr9|}||D]}||vr2|||||q!t|dks|S)zAReturns a subgraph rooted at src that shows all the paths to dst.r) rr6rr.r/r"rr1to_dot)r r*r9Z result_graphZforward_reachable_from_srcr4r5rr r r all_pathsvs     zDiGraph.all_pathscCstg}|r4|||j|}d\}}|D]}|j|d}|dur%n |dus-||kr1|}|}q|stt|S)z_Returns a list of nodes that show the first path that resulted in dst being added to the graph.)NN)r1rkeysr getlistreversed)r r9path candidatesmin_idx candidateidxr r r first_paths  zDiGraph.first_pathcCs"ddd|jD}d|dS)zvReturns the dot representation of the graph. Returns: A dot representation of the graph.  css&|]\}}d|d|dVqdS)"z" -> "z";Nr ).0ftr r r s$z!DiGraph.to_dot..z,digraph G { rankdir = LR; node [shape=box]; z } )joinr%)r r%r r rr:szDiGraph.to_dotN)__name__ __module__ __qualname____doc__rrrr r"propertyr%r&r'r)strrr6r8r;rrFr:r r r rrs$     rN) collectionsrtypingrrrr r r rs