o Rŀg{@s6dZddlmZGdddZd ddZd dd ZdS) z3get/set abstraction for multi-graph representation.)reducec@seZdZdZd"ddZddZddZd d Zd d Zd#ddZ ddZ ddZ ddZ ddZ ddZddZddZddZd d!Zd S)$ MultiGraphz5A directed multigraph abstraction with labeled edges.cCs&i|_|D]}t|j|<qi|_dS)z#Initialize a new MultiGraph object.N)_adjacency_listset _label_map)selfnodesnrrN/var/www/html/myenv/lib/python3.10/site-packages/Bio/Pathway/Rep/MultiGraph.py__init__s zMultiGraph.__init__cCs"t|to|j|jko|j|jkS)z(Return true if g is equal to this graph.) isinstancerrr)rgrrr __eq__s   zMultiGraph.__eq__c CsPd}t|jD]}t|j|}|d|dddd|Dd7}q|dS) z4Return a unique string representation of this graph. &sz&MultiGraph.__repr__..)>)sortedrjoin)rskeyvaluesrrr __repr__!s (zMultiGraph.__repr__cCsZt|j}tdddd|jD}t|j}dt|dt|dt|dS) z2Return a concise string description of this graph.cSs||Srr)xyrrr -sz$MultiGraph.__str__..cSsg|]}t|qSr)lenrrrr -z&MultiGraph.__str__..rz node(s), z edge(s), z unique label(s)>)r$rrrrstr)rnodenumedgenumlabelnumrrr __str__)s&  zMultiGraph.__str__cCs||jvr t|j|<dSdS)zAdd a node to this graph.N)rr)rnoderrr add_node:s zMultiGraph.add_nodeNcCsz||jvr tdt|||jvrtdt|||f}|j||||jvr1t|j|<|j|||fdS)zAdd an edge to this graph.zUnknown node: zUnknown node: N)r ValueErrorr'addrr)rsourcetolabeledgerrr add_edge?s    zMultiGraph.add_edgecC(||jvr tdt|t|j|S)z1Return a list of (child, label) pairs for parent.zUnknown node: )rr.r'rrparentrrr child_edgesK zMultiGraph.child_edgescCtdd||DS)z,Return a list of unique children for parent.cSh|]}|dqSrrrr!rrr Sr&z&MultiGraph.children..)rr8r6rrr childrenQzMultiGraph.childrencCr5)z/Return a list of all the edges with this label.zUnknown label: )rr.r'r)rr2rrr edgesUr9zMultiGraph.edgescCt|jS)z3Return a list of all the edge labels in this graph.)rrkeysrrrr labels[zMultiGraph.labelscCrB)z)Return a list of the nodes in this graph.)listrrCrDrrr r _rFzMultiGraph.nodescCsb||jvr tdt|g}|jD]\}}|D]}|d|kr+|||dfqqt|S)z1Return a list of (parent, label) pairs for child.zUnknown node: r)rr.r'itemsappendr)rchildparentsr7r?r!rrr parent_edgescs  zMultiGraph.parent_edgescCr:)z*Return a list of unique parents for child.cSr;r<rr=rrr r>pr&z%MultiGraph.parents..)rrM)rrKrrr rLnr@zMultiGraph.parentscs|jvr tdt|j=|jD]}fdd|j|D|j|<qt|jD]}fdd|j|D}|rC||j|<q-|j|=q-dS)z*Remove node and all edges connected to it.zUnknown node: csh|] }|dkr|qSr<rr=r,rr r>zsz)MultiGraph.remove_node..cs(h|]}|dkr|dkr|qS)rrHrr=rNrr r>s"N)rr.r'rGrrC)rr,r r2lmrrNr remove_noders      zMultiGraph.remove_nodecCstd)zRemove edge (NOT IMPLEMENTED).z"remove_edge is not yet implemented)NotImplementedError)rr7rKr2rrr remove_edgeszMultiGraph.remove_edge)rr)__name__ __module__ __qualname____doc__r rr r+r-r4r8r?rArEr rMrLrPrRrrrr rs"     rNcCsi}g}t|dkr|S|dur|d}d||<||||}t|dkrP|d}|dd}||vrJ||d||<|||}t|dks,|S)zDepth first search of g. Returns a list of all nodes that can be reached from the root node in depth-first order. If root is not given, the search will be rooted at an arbitrary node. rHNr)r$r rJr?graphrootseensearchcurrentr,rrr df_searchs$       r]cCsi}g}t|dkr|S|dur|d}d||<||||}t|dkrQ|d}|dd}||vrK||d||<|||t|dks,|S)zBreadth first search of g. Returns a list of all nodes that can be reached from the root node in breadth-first order. If root is not given, the search will be rooted at an arbitrary node. rHNr)r$r rJr?extendrWrrr bf_searchs$       r_r)rV functoolsrrr]r_rrrr s