a 8Sic@s.ddlmZddlmZmZGdddZdS))deque)SetListc@seZdZdZddZddZddZdd Zd d Ze d d Z e ddZ ddZ ddZ eeedddZeeedddZeedddZeeedddZedd d!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 R/var/www/html/django/DPS/env/lib/python3.9/site-packages/torch/package/_digraph.py__init__ s zDiGraph.__init__cKsX||jvrD||j|<i|j|<i|j|<|j|j|<|jd7_n|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 CsLzt|j|WStyF}ztd|d|WYd}~n d}~00dS)z.Returns an iterator over successor nodes of n. The node  is not in the digraph.N)iterrKeyError ValueErrorr rer r r successors7szDiGraph.successorsc CsLzt|j|WStyF}ztd|d|WYd}~n d}~00dS)z1Returns an iterator over predecessors nodes of n.rrN)rrrrrr r r predecessors>szDiGraph.predecessorsccs,|jD]\}}|D]}||fVqq dS)z6Returns an iterator over all edges (u, v) in the graphN)ritems)r rrZsuccr r redgesEsz 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__QszDiGraph.__iter__cCs&z ||jvWSty YdS0dS)z>Returns True if ``n`` is a node in the graph, False otherwise.FN)r TypeError)r rr r r __contains__Us  zDiGraph.__contains__)srcreturncCsVt|}t|}t|dkrR|}||D] }||vr.||||q.q|S)z2Returns a set of nodes that are reachable from srcr)setrlenpopleftraddappendr r'result working_setcurrr r rforward_transitive_closure\s  z"DiGraph.forward_transitive_closurecCsVt|}t|}t|dkrR|}||D] }||vr.||||q.q|S)zGReturns a set of nodes that are reachable from src in reverse directionr)r)rr*r+r r,r-r.r r rbackward_transitive_closureis  z#DiGraph.backward_transitive_closure)r'dstcCspt}||}||vr|St|}t|dkrh|}||D]"}||vrB|||||qBq$|S)zAReturns a subgraph rooted at src that shows all the paths to dst.r) rr2rr*r+r rr-to_dot)r r'r4Z result_graphZforward_reachable_from_srcr0r1rr r r all_pathsvs   zDiGraph.all_paths)r4r(cCsrg}|rf|||j|}d\}}|D]6}|j|d}|durJq|dusZ||kr,|}|}q,qtt|S)z_Returns a list of nodes that show the first path that resulted in dst being added to the graph.)NN)r-rkeysr getlistreversed)r r4path candidatesmin_idx candidateidxr r r first_paths zDiGraph.first_path)r(cCs"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 z!DiGraph.to_dot..z,digraph G { rankdir = LR; node [shape=box]; z } )joinr")r r"r r rr5szDiGraph.to_dotN)__name__ __module__ __qualname____doc__rrrrr propertyr"r#r$r&strrr2r3r6rrAr5r r r rrs"     rN) collectionsrtypingrrrr r r rs