3 Md*@s^dZddlZddddddd gZdd dZd dZd dZd dZddZddZ ddd Z dS)zA Operations on graphs including union, intersection, difference. Nunioncomposedisjoint_union intersection differencesymmetric_difference full_joinc Cs<|j|jkstjd|j}|jj|j|jj|jdd}|||d}|||d}t|t|@r~tjdd|jr|jddd }n |jdd }|jr|jddd }n |jdd }|j||j||j ||j |x"|D]}|j |j|j |qWx$|D]}|j |j|j |qW|S) a 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 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 z+G and H must both be graphs or multigraphs.cs$dkr |Sfdd}tj||S)Ncs$t|tr|}n t|}|S)N) isinstancestrrepr)xname)prefixV/var/www/html/virt/lib/python3.6/site-packages/networkx/algorithms/operators/binary.pylabelAs   z(union..add_prefix..label)nx relabel_nodes)graphrrr)rr add_prefix=s zunion..add_prefixrz*The node sets of G and H are not disjoint.zCUse appropriate rename=(Gprefix,Hprefix)or use disjoint_union(G,H).T)keysdata)r) is_multigraphr NetworkXError __class__rupdatesetedgesadd_nodes_fromadd_edges_fromnodes) GHrenamer RrZG_edgesZH_edgesnrrrrs6#          cCsFtj|}tj|t|d}t||}|jj|j|jj|j|S)a 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. )Z first_label)rZconvert_node_labels_to_integerslenrrr)r"r#ZR1ZR2r%rrrris   cCstj|}|j|jks$tjdt|t|kr>tjd|j|jkr|jrd|jdd}n|j}xb|D]}|j|rr|j|qrWn@|jr|jdd}n|j}x |D]}|j|r|j|qW|S)aReturns 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) z+G and H must both be graphs or multigraphs.z!Node sets of graphs are not equalT)r) rcreate_empty_copyrrrZnumber_of_edgesrhas_edgeadd_edge)r"r#r%rerrrrs&       cCs|j|jkstjdtj|}t|t|kr>tjd|jrT|jdd}n|j}x |D]}|j|sb|j|qbW|S)aReturns 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) z+G and H must both be graphs or multigraphs.zNode sets of graphs not equalT)r)rrrr(rrr)r*)r"r#r%rr+rrrrs     cCs|j|jkstjdtj|}t|t|kr>tjdt|}t|}|j|}|j||jrx|jdd}n|j}x |D]}|j|s|j |qW|jr|jdd}n|j}x |D]}|j|s|j |qW|S)aReturns 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. z+G and H must both be graphs or multigraphs.zNode sets of graphs not equalT)r) rrrr(rrrrr)r*)r"r#r%ZgnodesZhnodesr!rr+rrrrs,         cCs|j|jkstjd|j}|jj|j|jj|j|j|jdd|j|jdd|jr|j|j dddn|j|j dd|jr|j|j dddn|j|j dd|S)aReturns 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 do not need to be disjoint. Parameters ---------- G, H : graph A NetworkX 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. For MultiGraphs, the edges are identified by incident nodes AND edge-key. This can cause surprises (i.e., edge `(1, 2)` may or may not be the same in two graphs) if you use MultiGraph without keeping track of edge keys. z+G and H must both be graphs or multigraphs.T)r)rr) rrrrrrrr!r r)r"r#r%rrrr!s cCst|||}dd}|||d}|||d}x&|D]}x|D]}|j||q@Wq6W|jrx&|D]}x|D]}|j||qpWqfW|S)aReturns the full join of graphs G and H. Full join is the union of G and H in which all edges between G and H are added. The node sets of G and H must be disjoint, otherwise an exception is raised. Parameters ---------- G, H : graph A NetworkX graph 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". Returns ------- U : The full join graph with the same type as G. Notes ----- It is recommended that G and H be either both directed or both undirected. If G is directed, then edges from G to H are added as well as from H to G. Note that full_join() does not produce parallel edges for MultiGraphs. The full join operation of graphs G and H is the same as getting their complement, performing a disjoint union, and finally getting the complement of the resulting graph. 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 -------- union disjoint_union cs$dkr |Sfdd}tj||S)Ncs$t|tr|}n t|}|S)N)r r r )r r )rrrrs   z,full_join..add_prefix..label)rr)rrrr)rrr|s zfull_join..add_prefixrr)rr*Z is_directed)r"r#r$r%rijrrrrOs+      NN)r.NNN)r/) __doc__Znetworkxr__all__rrrrrrrrrrrs X"6,4.