ó ú£Õ\c@s•dZddlZddlmZdjdddgƒZdd d d d d gZddd„Z d„Z d„Z d„Z d„Z dd„ZdS(sA Operations on graphs including union, intersection, difference. iÿÿÿÿN(tis_string_likes sAric Hagberg (hagberg@lanl.gov)sPieter Swart (swart@lanl.gov)sDan Schult(dschult@colgate.edu)tuniontcomposetdisjoint_uniont intersectiont differencetsymmetric_differencecCsŠ|jƒ}|d kr1d|j|jf}n||_d„}|||dƒ}|||dƒ}t|ƒt|ƒ@r”tjddƒ‚n|jƒr»|jdtdtƒ}n|jdtƒ}|jƒrô|jdtdtƒ}n|jdtƒ}|j |ƒ|j |ƒ|j |ƒ|j |ƒ|j j |j ƒ|j j |j ƒ|j j |j ƒ|j j |j ƒ|S( sØ Return the union of graphs G and H. Graphs G and H must be disjoint, otherwise an exception is raised. Parameters ---------- G,H : graph A NetworkX graph create_using : NetworkX graph Use specified graph for result. Otherwise rename : bool , default=(None, None) Node names of G and H can be changed by specifying the tuple rename=('G-','H-') (for example). Node "u" in G is then renamed "G-u" and "v" in H is renamed "H-v". name : string Specify the name for the union graph Returns ------- U : A union graph with the same type as G. Notes ----- To force a disjoint union with node relabeling, use disjoint_union(G,H) or convert_node_labels_to integers(). Graph, edge, and node attributes are propagated from G and H to the union graph. If a graph attribute is present in both G and H the value from H is used. See Also -------- disjoint_union sunion( %s, %s )cs/ˆdkr|S‡fd†}tj||ƒS(Ncs-t|ƒrˆ|}nˆt|ƒ}|S(N(Rtrepr(txtname(tprefix(s\/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/binary.pytlabelBs  (tNonetnxt relabel_nodes(tgraphR R ((R s\/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/binary.pyt add_prefix?s iis*The node sets of G and H are not disjoint.sCUse appropriate rename=(Gprefix,Hprefix)or use disjoint_union(G,H).tkeystdataN(t __class__R R tsetR t NetworkXErrort is_multigrapht edges_itertTruetadd_nodes_fromtadd_edges_fromtnodetupdateR(tGtHtrenameR tRRtG_edgestH_edges((s\/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/binary.pyRs2'            cCs|tj|ƒ}tj|dt|ƒƒ}t||ƒ}d|j|jf|_|jj|jƒ|jj|jƒ|S(s­ Return the disjoint union of graphs G and H. This algorithm forces distinct integer node labels. Parameters ---------- G,H : graph A NetworkX graph Returns ------- U : A union graph with the same type as G. Notes ----- A new graph is created, of the same class as G. It is recommended that G and H be either both directed or both undirected. The nodes of G are relabeled 0 to len(G)-1, and the nodes of H are relabeled len(G) to len(G)+len(H)-1. Graph, edge, and node attributes are propagated from G and H to the union graph. If a graph attribute is present in both G and H the value from H is used. t first_labelsdisjoint_union( %s, %s )(R tconvert_node_labels_to_integerstlenRR RR(RRtR1tR2R ((s\/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/binary.pyRhscCs+tj|ƒ}d|j|jf|_t|ƒt|ƒkrRtjdƒ‚n|jƒ|jƒkrÊ|jƒr‹|jdtƒ}n |jƒ}x|D]%}|j |Œrž|j |ŒqžqžWn]|jƒrë|jdtƒ}n |jƒ}x-|D]%}|j |Œrþ|j |ŒqþqþW|S(sºReturn a new graph that contains only the edges that exist in both G and H. The node sets of H and G must be the same. Parameters ---------- G,H : graph A NetworkX graph. G and H must have the same node sets. Returns ------- GH : A new graph with the same type as G. Notes ----- Attributes from the graph, nodes, and edges are not copied to the new graph. If you want a new graph of the intersection of G and H with the attributes (including edge data) from G use remove_nodes_from() as follows >>> G=nx.path_graph(3) >>> H=nx.path_graph(5) >>> R=G.copy() >>> R.remove_nodes_from(n for n in G if n not in H) sIntersection of (%s and %s)s!Node sets of graphs are not equalR( R tcreate_empty_copyR RRtnumber_of_edgesRRRthas_edgetadd_edge(RRR tedgeste((s\/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/binary.pyR‹s$      cCs³tj|ƒ}d|j|jf|_t|ƒt|ƒkrRtjdƒ‚n|jƒrs|jdtƒ}n |jƒ}x-|D]%}|j|Œs†|j |Œq†q†W|S(s²Return a new graph that contains the edges that exist in G but not in H. The node sets of H and G must be the same. Parameters ---------- G,H : graph A NetworkX graph. G and H must have the same node sets. Returns ------- D : A new graph with the same type as G. Notes ----- Attributes from the graph, nodes, and edges are not copied to the new graph. If you want a new graph of the difference of G and H with with the attributes (including edge data) from G use remove_nodes_from() as follows: >>> G=nx.path_graph(3) >>> H=nx.path_graph(5) >>> R=G.copy() >>> R.remove_nodes_from(n for n in G if n in H) sDifference of (%s and %s)sNode sets of graphs not equalR( R R(R RRRRRR*R+(RRR R,R-((s\/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/binary.pyRÁs   cCsDtj|ƒ}d|j|jf|_t|ƒt|ƒkrRtjdƒ‚nt|ƒ}t|ƒ}|j|ƒ}|j|ƒ|jƒr§|jdt ƒ}n |jƒ}x-|D]%}|j |Œsº|j |ŒqºqºW|jƒr|jdt ƒ}n |jƒ}x-|D]%}|j |Œs|j |ŒqqW|S(s™Return new graph with edges that exist in either G or H but not both. The node sets of H and G must be the same. Parameters ---------- G,H : graph A NetworkX graph. G and H must have the same node sets. Returns ------- D : A new graph with the same type as G. Notes ----- Attributes from the graph, nodes, and edges are not copied to the new graph. s#Symmetric difference of (%s and %s)sNode sets of graphs not equalR( R R(R RRRRRRRR*R+(RRR tgnodesthnodestnodesR,R-((s\/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/binary.pyRës*         cCs>|dkr%d|j|jf}n|jƒ}||_|j|jƒƒ|j|jƒƒ|jƒrŽ|j|jdtdtƒƒn|j|jdtƒƒ|jƒrÕ|j|jdtdtƒƒn|j|jdtƒƒ|j j |j ƒ|j j |j ƒ|j j |j ƒ|j j |j ƒ|S(sReturn a new graph of G composed with H. Composition is the simple union of the node sets and edge sets. The node sets of G and H need not be disjoint. Parameters ---------- G,H : graph A NetworkX graph name : string Specify name for new graph Returns ------- C: A new graph with the same type as G Notes ----- It is recommended that G and H be either both directed or both undirected. Attributes from H take precedent over attributes from G. scompose( %s, %s )RRN( R R RRR0RRRRRRR(RRR R ((s\/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/binary.pyRs"    " "(NN(t__doc__tnetworkxR tnetworkx.utilsRtjoint __author__t__all__R RRRRRR(((s\/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/binary.pyts     V # 6 * 2