U ?hóã@sNdZddlmZmZddlZddddgZd d d„Zd d„Zd d„Z d d„Z dS)zOperations on many graphs. é)ÚchainÚrepeatNÚ union_allÚ compose_allÚdisjoint_union_allÚintersection_all©csüd}tƒ}dd„‰t|tdƒƒ}‡fdd„t||ƒDƒ}t|ƒD]¦\}}t|jƒ}|dkrd| ¡}n2| ¡| ¡kr€t  d¡‚n|  |¡s–t  dd ¡‚||O}|j   |j ¡|  |jd d ¡| | ¡rØ|jd d d n |jd d ¡q@|dkrøtd ƒ‚|S)aReturns the union of all graphs. The graphs must be disjoint, otherwise an exception is raised. Parameters ---------- graphs : iterable Iterable of NetworkX graphs rename : iterable , optional Node names of graphs 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". Infinite generators (like itertools.count) are also supported. Returns ------- U : a graph with the same type as the first graph in list Raises ------ ValueError If `graphs` is an empty list. Notes ----- To force a disjoint union with node relabeling, use disjoint_union_all(G,H) or convert_node_labels_to integers(). Graph, edge, and node attributes are propagated to the union graph. If a graph attribute is present in multiple graphs, then the value from the last graph in the list with that attribute is used. See Also -------- union disjoint_union_all Ncs$ˆdkr |S‡fdd„}t ||¡S)Ncs ˆ›|›S©Nr)Úx©ÚprefixrúS/var/www/html/venv/lib/python3.8/site-packages/networkx/algorithms/operators/all.pyÚlabel9sz,union_all..add_prefix..label)ÚnxZ relabel_nodes)Úgraphr rrr r Ú add_prefix5s zunion_all..add_prefixc3s|]\}}ˆ||ƒVqdSr r)Ú.0ÚGÚname©rrr Ú ?szunion_all..rú)All graphs must be graphs or multigraphs.z-The node sets of the graphs are not disjoint.z[Use appropriate rename=(G1prefix,G2prefix,...,GNprefix)or use disjoint_union(G1,G2,...,GN).T©Údata©Úkeysrz'cannot apply union_all to an empty list)ÚsetrrÚzipÚ enumerateÚnodesÚ __class__Ú is_multigraphrÚ NetworkXErrorÚ isdisjointrÚupdateÚadd_nodes_fromÚadd_edges_fromÚedgesÚ ValueError)ÚgraphsÚrenameÚRZ seen_nodesÚirÚ G_nodes_setrrr r s2'     þ ÿcCsdd„}t||ƒƒ}|S)açReturns the disjoint union of all graphs. This operation forces distinct integer node labels starting with 0 for the first graph in the list and numbering consecutively. Parameters ---------- graphs : iterable Iterable of NetworkX graphs Returns ------- U : A graph with the same type as the first graph in list Raises ------ ValueError If `graphs` is an empty list. Notes ----- It is recommended that the graphs be either all directed or all undirected. Graph, edge, and node attributes are propagated to the union graph. If a graph attribute is present in multiple graphs, then the value from the last graph in the list with that attribute is used. css.d}|D] }tj||dV|t|ƒ7}qdS)Nr)Ú first_label)rZconvert_node_labels_to_integersÚlen)r)r.rrrr Úyield_relabeledzsz+disjoint_union_all..yield_relabeled)r)r)r0r+rrr r]s cCsžd}t|ƒD]|\}}|dkr&| ¡}n| ¡| ¡kr@t d¡‚|j |j¡| |jdd¡|  | ¡rz|j dddn |j dd¡q |dkršt dƒ‚|S)aìReturns the composition of all graphs. Composition is the simple union of the node sets and edge sets. The node sets of the supplied graphs need not be disjoint. Parameters ---------- graphs : iterable Iterable of NetworkX graphs Returns ------- C : A graph with the same type as the first graph in list Raises ------ ValueError If `graphs` is an empty list. Notes ----- It is recommended that the supplied graphs be either all directed or all undirected. Graph, edge, and node attributes are propagated to the union graph. If a graph attribute is present in multiple graphs, then the value from the last graph in the list with that attribute is used. NrrTrrz)cannot apply compose_all to an empty list) rr r!rr"rr$r%rr&r'r()r)r+r,rrrr r…s   ÿcCs¼d}t|ƒD]†\}}t|jƒ}t| ¡r4|jddn| ¡ƒ}|dkrX| ¡}|}|}n,| ¡| ¡krtt d¡‚n||M}||M}|j  |j¡q |dkr¤t dƒ‚|  |¡|  |¡|S)aÉReturns a new graph that contains only the nodes and the edges that exist in all graphs. Parameters ---------- graphs : iterable Iterable of NetworkX graphs Returns ------- R : A new graph with the same type as the first graph in list Raises ------ ValueError If `graphs` is an empty list. Notes ----- Attributes from the graph, nodes, and edges are not copied to the new graph. NT)rrrz.cannot apply intersection_all to an empty list) rrrr!r'r rr"rr$r(r%r&)r)r+r,rr-Z G_edges_setZnode_intersectionZedge_intersectionrrr r¸s$     )r) Ú__doc__Ú itertoolsrrZnetworkxrÚ__all__rrrrrrrr Ús  S(3