a n }T@sdZddlmZmZddlZddlZddlZddlZddlZddl Z ddl m Z ddl m Z ejdk Zer~dZeZeZeZnd Zegd Zegd Zegd Zegd ZddZdAddZGdddeZgdZe dej!Z"e dej!Z#e dej!Z$e dej!Z%e dej&ej!BZ'e dej&ej!BZ(ddZ)ddZ*d d!Z+d"d#Z,dBd%d&Z-dCd'd(Z.dDd)d*Z/d+d,Z0d-d.Z1Gd/d0d0e2Z3Gd1d2d2e4Z5Gd3d4d4e4Z6Gd5d6d6e3Z7Gd7d8d8e3Z8Gd9d:d:e3Z9Gd;d<dd>e9Z;Gd?d@d@e9Zz|jWSty8ttt|}|_|YS0dSrT)Z _cached_hashrRhashr\sortedrY)rfhrDrDrE__hash__s  zfrozendict.__hash__cCsdt|S)Nzfrozendict(%s))rU__repr__rfrDrDrErkszfrozendict.__repr__N)__name__ __module__ __qualname__rSproperty __delitem__ __setitem__clearpoppopitem setdefaultupdaterVr]rjrkrDrDrDrErQs rQ)graphsubgraphdigraphnodeedgestrictz^[_a-zA-Z][a-zA-Z0-9_,]*$z*^[_a-zA-Z][a-zA-Z0-9_,:"]*[a-zA-Z0-9_,"]+$z ^[0-9,]+$z^([^:]*):([^:]*)$z^".*"$z^<.*>$cCs|tvr dSdd|D}|r6t|s6t|s6dStttttfD]}||rDdSqDt|}|rt| dpt| dSdS)aChecks whether a string is a dot language ID. It will check whether the string is solely composed by the characters allowed in an ID or not. If the string is one of the reserved keywords it will need quotes too but the user will need to add them manually. FcSs,g|]$}t|dks t|dkrt|qS)r)ord).0crDrDrE rz needs_quotes..Tr) dot_keywordsid_re_dbl_quotedmatch id_re_htmlid_re_alpha_nums id_re_numid_re_alpha_nums_with_portsid_re_with_port needs_quotesr9)scharsZtest_remrDrDrErs  rcCs~|dkr dSt|tr&|dur"dSdSt|ts4|S|s<|St|rzdddd }|D]\}}|||}qXd |d S|S) Nr z""TTrueFalsez\"z\nz\r)"  r)rWbool basestringrrYreplace)rrabrDrDrEquote_if_necessary s     rcCs t|S)zLoad graph as defined by data in DOT format. The data is assumed to be in DOT format. It will be parsed and a Dot class will be returned, representing the graph. )rZparse_dot_data)datarDrDrEgraph_from_dot_data&srcCs"t|d}|}|t|S)zLoad graph as defined by a DOT file. The file is assumed to be in DOT format. It will be loaded, parsed and a Dot class will be returned, representing the graph. rb)rIreadrOr)pathfdrrDrDrEgraph_from_dot_file1s rFcCs|rtdd}n tdd}|D]p}t|dtr>||d}n|t|d}t|dtrj||d}n|t|d}t||}||q|S)a<Creates a basic graph out of an edge list. The edge list has to be a list of tuples representing the nodes connected by the edge. The values can be anything: bool, int, float, str. If the graph is undirected by default, it is only calculated from one of the symmetric halves of the matrix. rz graph_typerxrr)DotrWstrEdgeadd_edge) edge_list node_prefixdirectedrxr|srcdsterDrDrEgraph_from_edges@s     rc Csd}|rtdd}n tdd}|D]f}|sB||}||d}nd}|}|d}|D](} | rv|t|||||d7}qV|d7}q"|S)zCreates a basic graph out of an adjacency matrix. The matrix has to be a list of rows of values representing an adjacency matrix. The values can be anything: bool, int, float, as long as they can evaluate to True or False. rrzrrxNr)rindexrr) matrixrrZ node_origrxrowskiprZ node_destrrDrDrEgraph_from_adjacency_matrixcs,      rcCs|rtdd}n tdd}|D]h}g}d}|D]}|rD||||d7}q.|t|dkr|t|t|d||dq|s|d|S)zCreates a basic graph out of an incidence matrix. The matrix has to be a list of rows of values representing an incidence matrix. The values can be anything: bool, int, float, as long as they can evaluate to True or False. rzrrxrrrT)rr[sortr3rrabs set_simplify)rrrrxrnodesrr{rDrDrEgraph_from_incidence_matrixs*       rcCs$d}ddddddd}d}|}|drF|drF|dd}d}tj|r|D]}||rjq\tjtj||r|rdtj||d||<ntj||||<d}q\tjtj||dr\|rdtj||dd||<ntj||d||<d}q\|r|Sd Sd S) zUsed by find_graphviz path - single directory as a string If any of the executables are found, it will return a dictionary containing the program names as keys and their paths as values. Otherwise returns None Fr )dotZtwopiZneatoZcircoZfdpZsfdprrTz.exeN) strip startswithendswithrKrisdirkeysexistsjoin)rsuccessprogsZ was_quotedZprgrDrDrE__find_executabless<     rc stjjdkr2d}d}d}d}d}zddl}|j}|j}|j}WntyRYn0z.ddlfdd}fdd }j j j}WntyYn0|dur2d}d d g}|D]}z`|||d|}|dur||d } ||| sWqtj | d } t | } | dur| WSWnty(Yq0q2qdtjvrrtjdtjD] } t | } | durP| SqPtjjdkrdtjvrtj tjdddd } nd} t | } | dur| SdD] } t | } | dur| SqdS)a}Locate Graphviz's executables in the system. Tries three methods: First: Windows Registry (Windows only) This requires Mark Hammond's pywin32 is installed. Secondly: Search the path It will look for 'dot', 'twopi' and 'neato' in all the directories specified in the PATH environment variable. Thirdly: Default install location (Windows only) It will look for 'dot', 'twopi' and 'neato' in the default install location under the "Program Files" directory. It will return a dictionary containing the program names as keys and their paths as values. If this fails, it returns None. win32lrNrc s,d}jj||||||jS)Nr)c_uintwindlladvapi32Z RegOpenKeyExAbyrefvalue)keysubkeyoptZsamresultctypesrDrE RegOpenKeyExs  z#find_graphviz..RegOpenKeyExc sHd}d}d}jj||d||||jS)Nri)rcreate_string_bufferrrZRegQueryValueExArr)hkeyZ valuenameZ data_typeZdata_lenrrrDrERegQueryValueExs    z&find_graphviz..RegQueryValueExzSOFTWARE\ATT\Graphvizz$SOFTWARE\AT&T Research Labs\GraphvizZ InstallPathbinPATHZ PROGRAMFILESZATTZGraphVizz!C:\Program Files\att\Graphviz\bin)z/usr/binz/usr/local/binz/opt/local/binz/opt/binz/sw/binz /usr/sharez*/Applications/Graphviz.app/Contents/MacOS/)rKsysplatformwin32apirr RegCloseKey ImportErrorrrrrrr Exceptionenvironsplitpathsep) HKEY_LOCAL_MACHINEZKEY_QUERY_VALUErrrrrZ potentialKeysZ potentialKeyrrrDrrE find_graphvizs|                rc@sheZdZdZddZddZddZdd Zd d Zd d Z ddZ ddZ ddZ ddZ ddZdS)Commonz|Common information to several classes. Should not be directly used, several classes are derived from this one. cCst|j}|SrTrXobj_dict)rfrUrDrDrE __getstate__s zCommon.__getstate__cCs ||_dSrTrrfstaterDrDrE __setstate__szCommon.__setstate__cCs|jd|d}|dur|jd}|dvr0d}|}|durL||}ndSt|ttfsd|g}|D]"}|jd|d}|rh|Sqhn|SdS)z)Look for default attributes for this node attributesNtype)ryrzZclusterrx)rgetget_parent_graphget_noderWrZr\)rfattrattr_valZdefault_node_namegdefaultsdefaultrDrDrE__get_attribute__s"    zCommon.__get_attribute__cCs||jd<dSN parent_graphr)rfrrDrDrEset_parent_graphszCommon.set_parent_graphcCs|jddSrrrrlrDrDrErszCommon.get_parent_graphcCs||jd|<dS)aSet an attribute value by name. Given an attribute 'name' it will set its value to 'value'. There's always the possibility of using the methods: set_'name'(value) which are defined for all the existing attributes. rNr)rfnamerrDrDrEsets z Common.setcCs|jd|dS)zGet an attribute value by name. Given an attribute 'name' it will get its value. There's always the possibility of using the methods: get_'name'() which are defined for all the existing attributes. rNr)rfrrDrDrErs z Common.getcCs |jdS)r rrrlrDrDrEget_attributesszCommon.get_attributescCs||jd<dSNsequencerrfseqrDrDrE set_sequenceszCommon.set_sequencecCs |jdSrrrlrDrDrE get_sequenceszCommon.get_sequencecsF|D]<}d||ffdd d||ffdd qdS)Nset_csjd||S)Nr)rrr)xrrlrDrErz1Common.create_attribute_methods..get_cs |SrT)r)rrlrDrErr) __setattr__)rfZobj_attributesrrDrlrEcreate_attribute_methodsszCommon.create_attribute_methodsN)rmrnro__doc__rrrrrrrrrrrrDrDrDrErs(  rc@s eZdZdZddZddZdS)Errorz"General error handling class. cCs ||_dSrTrrfrrDrDrEr]szError.__init__cCs|jSrTr rlrDrDrE__str__sz Error.__str__Nrmrnror r]r rDrDrDrEr sr c@s eZdZdZddZddZdS)InvocationExceptionz` To indicate that a ploblem occurred while running any of the GraphViz executables. cCs ||_dSrTr r rDrDrEr]szInvocationException.__init__cCs|jSrTr rlrDrDrEr szInvocationException.__str__NrrDrDrDrEr src@sBeZdZdZdddZddZdd Zd d Zd d ZddZ dS)NodezA graph node. This class represents a graph's node with all its attributes. node(name, attribute=value, ...) name: node's name All the attributes defined in the Graphviz dot language should be supported. r NcKs|dur||_nt|_t||jd<d|jd<d|jd<d|jd<d|jd<d}t|tr|ds|d}|d kr|d t|kr|d|||d}}t|ttfrt |}t ||jd <||jd <| t dS) Nrr{rrZparent_node_listrr:rrrport) rrUrWrrfindr3longintrrrNODE_ATTRIBUTES)rfrrattrsridxrDrDrEr]"s$      z Node.__init__cCs||jd<dS)zSet the node's name.rNr)rfZ node_namerDrDrEset_nameGsz Node.set_namecCs |jdS)zGet the node's name.rrrlrDrDrEget_nameLsz Node.get_namecCs |jdS)zGet the node's port.rrrlrDrDrEget_portQsz Node.get_portcCsN|jddd}|s"|r"|g}n|d}||d||jdd<dS)Nrr6,)rrrr[r)rfr6ZstylesrDrDrE add_styleVs   zNode.add_stylecCst|jd}t}t|jdtddD]2\}}|durV|d|t|fq.||q.|dvrzt|dkrzdSd |}|r|d |d 7}|d S) zEReturns a string representation of the node in dot language. rrrrN%s=%s)rxr{r|r ,  [];) rrrZrhrYrr[r3r)rfr{Z node_attrrrrDrDrE to_stringas   zNode.to_string)r N) rmrnror r]rrrrr$rDrDrDrErs % rc@sJeZdZdZdddZddZdd Zd d Zd d ZddZ ddZ dS)raxA graph edge. This class represents a graph's edge with all its attributes. edge(src, dst, attribute=value, ...) src: source node's name dst: destination node's name All the attributes defined in the Graphviz dot language should be supported. Attributes can be set through the dynamically generated methods: set_[attribute name], i.e. set_label, set_fontname or directly by using the instance's special dictionary: Edge.obj_dict['attributes'][attribute name], i.e. edge_instance.obj_dict['attributes']['label'] edge_instance.obj_dict['attributes']['fontname'] r NcKst|ttfr|dkr|\}}|dur.||_n|t|_t||jd<d|jd<d|jd<d|jd<d|jd<t|tr~|}t|tr|}t|t|f}||jd<|t dS) Nr rr|rrZparent_edge_listrpoints) rWrZr\rrUrrrrEDGE_ATTRIBUTES)rfrrrrr%rDrDrEr]s"       z Edge.__init__cCs|jddS)zGet the edges source node name.r%rrrlrDrDrE get_sourceszEdge.get_sourcecCs|jddS)z%Get the edge's destination node name.r%rrrlrDrDrEget_destinationszEdge.get_destinationcCstt|t|SrT)rgr'r(rlrDrDrErjsz Edge.__hash__cCst|tstd|dkrh||krB||ksb||kr||krdSn$||kr||krdSdS)a)Compare two edges. If the parent graph is directed, arcs linking node A to B are considered equal and A->B != B->A If the parent graph is undirected, any edge connecting two nodes is equal to any other edge connecting the same nodes, A->B == B->A z,Can't compare and edge to a non-edge object.rxTF)rWrr rget_top_graph_typer'r()rfr|rDrDrE__eq__s z Edge.__eq__cCst|ts|S|dr&|dr&|S|d}|dkrX|ddkrX||ddkrX|S|dkr|d|}||dd}t|}|dt|7}|S|S)Nrrrr)rWrrrrfindr)rfZnode_strZ node_port_idxrrr{rDrDrEparse_node_refs    zEdge.parse_node_refcCs`||}||}t|tr8t|dg}n t|ttfrRt |g}n|g}| r| r| dkr| dn | dt|tr| t|dn(t|ttfr| t |n | |t }t|jdtddD]4\}}|dur$| d |t|fq| |qd |}|rR| d |d d |dS)zEReturns a string representation of the edge in dot language. rrzz->z--rrrNrr r!r" r#)r,r'r(rWrQSubgraphr$rrrrr)r[rZrhrrYrrr)rfrrr|Z edge_attrrrrDrDrEr$s>           zEdge.to_string)r r N) rmrnror r]r'r(rjr*r,r$rDrDrDrErs ! rc@s8eZdZdZdNddZdd Zd d Zd d ZddZddZ ddZ ddZ ddZ ddZ ddZddZddZd d!Zd"d#Zd$d%Zd&d'Zd(d)Zd*d+Zd,d-Zd.d/ZdOd0d1Zd2d3Zd4d5Zd6d7Zd8d9ZdPd:d;ZdQdd?Z d@dAZ!dBdCZ"dDdEZ#dFdGZ$dHdIZ%dJdKZ&dLdMZ'dS)RGrapha8Class representing a graph in Graphviz's dot language. This class implements the methods to work on a representation of a graph in Graphviz's dot language. graph(graph_name='G', graph_type='digraph', strict=False, suppress_disconnected=False, attribute=value, ...) graph_name: the graph's name graph_type: can be 'graph' or 'digraph' suppress_disconnected: defaults to False, which will remove from the graph any disconnected nodes. simplify: if True it will avoid displaying equal edges, i.e. only one edge between two nodes. removing the duplicated ones. All the attributes defined in the Graphviz dot language should be supported. Attributes can be set through the dynamically generated methods: set_[attribute name], i.e. set_size, set_fontname or using the instance's attributes: Graph.obj_dict['attributes'][attribute name], i.e. graph_instance.obj_dict['attributes']['label'] graph_instance.obj_dict['attributes']['fontname'] GNrzFcKs|dur||_nt|_t||jd<|dvr:td|t||jd<||jd<||jd<||jd<||jd<d |jd <t|jd <t|jd <t|jd <|||tdS)Nr)rxrzzEInvalid type "%s". Accepted graph types are: graph, digraph, subgraphrrr}suppress_disconnectedsimplifyrcurrent_child_sequenceredges subgraphs)rrUr rrrGRAPH_ATTRIBUTES)rf graph_namerrr}r1r2rrDrDrEr]Ws*         zGraph.__init__cCs |jdSNrrrlrDrDrEget_graph_typeyszGraph.get_graph_typecCs&|}|}||krq|}q|jdSr8)rr)rfparentZparent_rDrDrEr)|s zGraph.get_top_graph_typecKs|tdi|dS)Nrx)rxadd_noderrfrrDrDrEset_graph_defaultsszGraph.set_graph_defaultscKs.|d}t|ttfr&dd|DS|S)NrxcSsg|] }|qSrDrrr{rDrDrErrz,Graph.get_graph_defaults..rrWrZr\rrfrZ graph_nodesrDrDrEget_graph_defaultss zGraph.get_graph_defaultscKs|tdi|dS)Nr{)r{r;r=rDrDrEset_node_defaultsszGraph.set_node_defaultscKs.|d}t|ttfr&dd|DS|S)Nr{cSsg|] }|qSrDr?r@rDrDrErrz+Graph.get_node_defaults..rArBrDrDrEget_node_defaultss zGraph.get_node_defaultscKs|tdi|dS)Nr|)r|r;r=rDrDrEset_edge_defaultsszGraph.set_edge_defaultscKs.|d}t|ttfr&dd|DS|S)Nr|cSsg|] }|qSrDr?r@rDrDrErrz+Graph.get_edge_defaults..rArBrDrDrEget_edge_defaultss zGraph.get_edge_defaultscCs||jd<dS)zSet whether to simplify or not. If True it will avoid displaying equal edges, i.e. only one edge between two nodes. removing the duplicated ones. r2Nr)rfr2rDrDrErszGraph.set_simplifycCs |jdS)z]Get whether to simplify or not. Refer to set_simplify for more information. r2rrlrDrDrE get_simplifyszGraph.get_simplifycCs||jd<dS)z+Set the graph's type, 'graph' or 'digraph'.rNr)rfrrDrDrEset_typeszGraph.set_typecCs |jdS)z+Get the graph's type, 'graph' or 'digraph'.rrrlrDrDrEget_typeszGraph.get_typecCs||jd<dS)zSet the graph's name.rNr)rfr7rDrDrErszGraph.set_namecCs |jdS)zGet the graph's name.rrrlrDrDrErszGraph.get_namecCs||jd<dS)z]Set graph to 'strict' mode. This option is only valid for top level graphs. r}NrrfvalrDrDrE set_strictszGraph.set_strictcCs |jdS)zjGet graph's 'strict' mode (True, False). This option is only valid for top level graphs. r}rrKrDrDrE get_strictszGraph.get_strictcCs||jd<dS)zSuppress disconnected nodes in the output graph. This option will skip nodes in the graph with no incoming or outgoing edges. This option works also for subgraphs and has effect only in the current graph/subgraph. r1NrrKrDrDrEset_suppress_disconnectedszGraph.set_suppress_disconnectedcCs |jdS)zoGet if suppress disconnected is set. Refer to set_suppress_disconnected for more information. r1rrKrDrDrEget_suppress_disconnectedszGraph.get_suppress_disconnectedcCs |jd}|jdd7<|S)Nr3rrrrDrDrEget_next_sequence_numbers zGraph.get_next_sequence_numbercCst|tstdt|||}|sT|jg|jd|<|| n|jd| |j| | dS)zxAdds a node object to the graph. It takes a node object as its only argument and returns None. z/add_node() received a non node class object: {}rN) rWrr@formatrrrrrrr[rrQ)rfZ graph_noder{rDrDrEr<s zGraph.add_nodecCsft|tr|}||jdvrb|durR|t|jd|krR|jd||=dS|jd|=dSdS)aPDelete a node from the graph. Given a node's name all node(s) with that same name will be deleted if 'index' is not specified or set to None. If there are several nodes with that same name and 'index' is given, only the node in that position will be deleted. 'index' should be an integer specifying the position of the node to delete. If index is larger than the number of nodes with that name, no action is taken. If nodes are deleted it returns True. If no action is taken it returns False. rNTF)rWrrrr3)rfrrrDrDrEdel_nodes  zGraph.del_nodecCs6t}||jdvr2|dd|jd|D|S)a Retrieve a node from the graph. Given a node's name the corresponding Node instance will be returned. If one or more nodes exist with that name a list of Node instances is returned. An empty list is returned otherwise. rcSsg|]}t|dqSrr)rrrDrDrEr?sz"Graph.get_node..)rZrextend)rfrrrDrDrEr1s   zGraph.get_nodecCs|S)zGet the list of Node instances.) get_node_listrlrDrDrE get_nodesGszGraph.get_nodescCs6t}|jdD]\}}|dd|Dq|S)z}Get the list of Node instances. This method returns the list of Node instances composing the graph. rcSsg|]}t|dqSrTrUrZobj_drDrDrErVsz'Graph.get_node_list..rZrrYrV)rfZ node_objsr{ obj_dict_listrDrDrErWLs   zGraph.get_node_listcCst|tstdt|||f}||jdvrV|jd|}||jn|jg|jd|<| | | | dS)zyAdds an edge object to the graph. It takes a edge object as its only argument and returns None. z/add_edge() received a non edge class object: {}r4N) rWrr@rRrr'r(rr[rrQrr)rfZ graph_edge edge_pointsrrDrDrEr^s zGraph.add_edgecCst|ttfr2|dur(t|ttfr(|}|\}}n ||}}t|trN|}t|tr`|}||f|jdvr|dur|t|jd||fkr|jd||f|=dS|jd||f=dSdS)aKDelete an edge from the graph. Given an edge's (source, destination) node names all matching edges(s) will be deleted if 'index' is not specified or set to None. If there are several matching edges and 'index' is given, only the edge in that position will be deleted. 'index' should be an integer specifying the position of the edge to delete. If index is larger than the number of matching edges, no action is taken. If edges are deleted it returns True. If no action is taken it returns False. Nr4TF) rWrZr\rrrrrr3)rf src_or_listrrrrDrDrEdel_edgews$     zGraph.del_edgecCst|ttfr0|dur0t|}|d|df}n||f}||f}t}||jdvsn|dkr||jdvr|jd||jd|d}|D] }|t|d|d|dq|S)a7Retrieved an edge from the graph. Given an edge's source and destination the corresponding Edge instance(s) will be returned. If one or more edges exist with that source and destination a list of Edge instances is returned. An empty list is returned otherwise. Nrrr4rxr)rWrZr\rr)rr[r)rfr]rr\Zedge_points_reverserZedges_obj_dictZ edge_obj_dictrDrDrEget_edges,     zGraph.get_edgecCs|SrT) get_edge_listrlrDrDrE get_edgesszGraph.get_edgescCs6t}|jdD]\}}|dd|Dq|S)z}Get the list of Edge instances. This method returns the list of Edge instances composing the graph. r4cSsg|]}t|dqSrT)rrYrDrDrErsz'Graph.get_edge_list..rZ)rfZ edge_objsr|r[rDrDrEr`s   zGraph.get_edge_listcCst|ts&t|ts&tdt|||jdvrX|jd|}||jn|jg|jd|<| | | | dS)zAdds an subgraph object to the graph. It takes a subgraph object as its only argument and returns None. z4add_subgraph() received a non subgraph class object:r5N) rWr.Clusterr@rRrrrr[rrQrr)rfsgraphZ sgraph_listrDrDrE add_subgraphs zGraph.add_subgraphcCsBt}||jdvr>|jd|}|D]}|t|dq(|S)a'Retrieved a subgraph from the graph. Given a subgraph's name the corresponding Subgraph instance will be returned. If one or more subgraphs exist with the same name, a list of Subgraph instances is returned. An empty list is returned otherwise. r5r)rZrrr[r.)rfrrZsgraphs_obj_dictr[rDrDrE get_subgraphs zGraph.get_subgraphcCs|SrT)get_subgraph_listrlrDrDrE get_subgraphs szGraph.get_subgraphscCs6t}|jdD]\}}|dd|Dq|S)z~Get the list of Subgraph instances. This method returns the list of Subgraph instances in the graph. r5cSsg|]}t|dqSrT)r.rYrDrDrErsz+Graph.get_subgraph_list..rZ)rfZ sgraph_objsrcr[rDrDrErf s   zGraph.get_subgraph_listcCs||jd<|jdD]}|D] }||d<q q|jdD]}|D] }||d<qFq>|jdD]}|D]}t|d|qlqddS)Nrrr4r5r)rvaluesr/r)rfrobj_listrCrDrDrErs   zGraph.set_parent_graphcCst}|jdddur8||kr8|jdr8|d|jddkrrd|jvrf|jdrf|dq|dn|d |jd |jdt|jd td d D]<\}}|dur|d|t |fn |||dqt }t}|jd D]}| |q|rHtt dd|D\}}t |t |}}nt t }}t} |jd D]}| |qjt} |jd D]} | | qtdd|| | D} | D]\} }|d dkr$t|d}|jddr||vr||vrq||dnp|d dkrxt|d}|jddrZ||vrZq||d||nt|d}||dq|dd|S)zReturns a string representation of the graph in dot language. It will return the graph and all its subelements in string from. r}Nzstrict rr Z show_keywordz subgraph { z{ z {} {} {{ rrrrrz; r4cSsg|] }|dqS)r%rDrrCrDrDrErZrz#Graph.to_string..rr5cSsg|]}|d|fqS)rrDrjrDrDrErhsr{rr1Frr|r2z} )rZrrrr[rRrhrYrrrrhrVziprrr$raddr.r)rfrxrrZ edges_doneZedge_obj_dictsrZ edge_src_setZ edge_dst_setZnode_obj_dictsZsgraph_obj_dictsZsgrirrCr{r|rcrDrDrEr$.s|               zGraph.to_string)r0NrzFFF)N)NN)N)(rmrnror r]r9r)r>rCrDrErFrGrrHrIrJrrrMrNrOrPrQr<rSrrXrWrr^r_rar`rdrergrfrr$rDrDrDrEr/3sN$ "      ) %r/c@seZdZdZdddZdS)r.ahClass representing a subgraph in Graphviz's dot language. This class implements the methods to work on a representation of a subgraph in Graphviz's dot language. subgraph( graph_name='subG', suppress_disconnected=False, attribute=value, ... ) graph_name: the subgraph's name suppress_disconnected: defaults to false, which will remove from the subgraph any disconnected nodes. All the attributes defined in the Graphviz dot language should be supported. Attributes can be set through the dynamically generated methods: set_[attribute name], i.e. set_size, set_fontname or using the instance's attributes: Subgraph.obj_dict['attributes'][attribute name], i.e. subgraph_instance.obj_dict['attributes']['label'] subgraph_instance.obj_dict['attributes']['fontname'] r NFcKs2tj|f||||d||dur.d|jd<dS)Nr7rr1r2ryr)r/r]rrfr7rr1r2rrDrDrEr]szSubgraph.__init__)r NFFrmrnror r]rDrDrDrEr.s!r.c@seZdZdZdddZdS)rbaClass representing a cluster in Graphviz's dot language. This class implements the methods to work on a representation of a cluster in Graphviz's dot language. cluster( graph_name='subG', suppress_disconnected=False, attribute=value, ... ) graph_name: the cluster's name (the string 'cluster' will be always prepended) suppress_disconnected: defaults to false, which will remove from the cluster any disconnected nodes. All the attributes defined in the Graphviz dot language should be supported. Attributes can be set through the dynamically generated methods: set_[attribute name], i.e. set_color, set_fontname or using the instance's attributes: Cluster.obj_dict['attributes'][attribute name], i.e. cluster_instance.obj_dict['attributes']['label'] cluster_instance.obj_dict['attributes']['fontname'] subGNFcKsJtj|f||||d||dur.zLRefer to the docstring accompanying the'create' method for more information.rawZwrite_csj|||dSrw)rH)rrzrxrlrDrErszKRefer to the docstring accompanying the'write' method for more information.) r/r]rZ shape_filesrformatsrxr__dict__r )rfZargslZargsdZfrmtrzrDrlrEr]s.   z Dot.__init__cCs t|jSrTrrlrDrDrErszDot.__getstate__cCs ||_dSrTrrrDrDrErszDot.__setstate__cCs4t|tr|j|t|ttfr0|j|dS)aAdd the paths of the required image files. If the graph needs graphic objects to be used as shapes or otherwise those need to be in the same folder as the graph is going to be rendered from. Alternatively the absolute path to the files can be specified when including the graphics in the graph. The files in the location pointed to by the path(s) specified as arguments to this method will be copied to the same temporary location where the graph is going to be rendered. N)rWrr|r[rZr\rV)rfZ file_pathsrDrDrEset_shape_files!s  zDot.set_shape_filescCs ||_dS)zSets the default program. Sets the default program in charge of processing the dot file into a graph. N)rx)rfrxrDrDrEset_prog4sz Dot.set_progcCs ||_dS)a This method allows to manually specify the location of the GraphViz executables. The argument to this method should be a dictionary where the keys are as follows: {'dot': '', 'twopi': '', 'neato': '', 'circo': '', 'fdp': ''} and the values are the paths to the corresponding executable, including the name of the executable itself. N)r)rfpathsrDrDrEset_graphviz_executables<szDot.set_graphviz_executablesNr{cCs|dur|j}t|d\}}z|dkr|}t|tr^t|ts^zt|d}Wn Yn0z"|}trp|std}||}Wntr|d}Yn0| |n| | ||W|r| n|r| 0dS)a[ Given a filename 'path' it will open/create and truncate such file and write on it a representation of the graph defined by the dot object and in the format specified by 'format'. 'path' can also be an open file-like object, such as a StringIO instance. The format 'raw' is used to dump the string representation of the Dot object, without further processing. The output can be processed by any of graphviz tools, defined in 'prog', which defaults to 'dot' Returns True or False according to the success of the write operation. There's also the preferred possibility of using: write_'format'(path, prog='program') which are automatically defined for all the supported formats. [write_ps(), write_gif(), write_dia(), ...] Nzw+br{zutf-8T) rxrPr$rWrunicode get_charsetPY3encoderHryrO)rfrrxrRrNrOrrrDrDrErHLs8      z Dot.writervc Cs`|dur|j}t|ttfr4|d|dd}}ng}|jdur\t|_|jdur\td||jvrrtd|tj |j|rtj |j|std |j|t \}}t|||tj|}|jD]L}t|d}|} |ttj|tj|d}|| |q|j|d ||g|} tj| |tjtjd } | j} | j} t}| }|s|q||qj| t|}| jst}| }|sq||q| |rt|}tr|t jj!}| "}|dkrtd ||fn|r(t#||jD]"}t$tj|tj|q.t$||S) a!Creates and returns a Postscript representation of the graph. create will write the graph to a temporary dot file and process it with the program given by 'prog' (which defaults to 'twopi'), reading the Postscript output and returning it as a string is the operation is successful. On failure None is returned. There's also the preferred possibility of using: create_'format'(prog='program') which are automatically defined for all the supported formats. [create_ps(), create_gif(), create_dia(), ...] If 'prog' is a list instead of a string the fist item is expected to be the program name, followed by any optional command-line arguments for it: ['twopi', '-Tdot', '-s10'] Nrrz GraphViz's executables not foundz$GraphViz's executable "%s" not foundz9GraphViz's executable "{}" is not a file or doesn't existrwbz-T)cwdstderrstdoutz6Program terminated with status: %d. stderr follows: %s)%rxrWrZr\rrrrKrrisfilerRtempfilemkstemprOrHdirnamer|rIrrbasename subprocessPopenPIPErrr[NULL_SEPclosedrdecoderencodingwaitprintunlink)rfrxrRr_Ztmp_fdZtmp_nameZtmp_dirZimgrzZf_dataZcmdlineprrZ stdout_outputrZ stderr_outputstatusrDrDrErys                 z Dot.create)Nr{)Nrv) rmrnror r]rrrrrrHryrDrDrDrErs) 9r)rG)r F)r F)r F)=r  __future__rrrKrerrrrXoperatorrr r version_inforrrrrrrrr6r&rrqrFrPrUrQrcompileUNICODErrrrSrrrrrrrrrrrobjectrrr rrrr/r.rbrrDrDrDrEsp       .1$  # ' '8|  l3[/1