h%dZddlmZmZddlZgdZejdddd dZejdddd Z ejdddd Z ejdd d Z y)zOperations on many graphs.)chainrepeatN) union_all compose_alldisjoint_union_allintersection_allz[graphs]T)graphspreserve_all_attrs returns_graphcVd}t}dt|td}fdt||D}t |D]R\}}t|j }|dk(r|j }n|j|jk7rtjd|j|jk7rtjd|j|stjd||z}|jj|j|j|j d |j|jr|j!dd n|j!d U| t#d |S) agReturns 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. NetworkXError In case of mixed type graphs, like MultiGraph and Graph, or directed and undirected graphs. Notes ----- For operating on mixed type graphs, they should be converted to the same type. >>> G = nx.Graph() >>> H = nx.DiGraph() >>> GH = union_all([nx.DiGraph(G), H]) 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. Examples -------- >>> G1 = nx.Graph([(1, 2), (2, 3)]) >>> G2 = nx.Graph([(4, 5), (5, 6)]) >>> result_graph = nx.union_all([G1, G2]) >>> result_graph.nodes() NodeView((1, 2, 3, 4, 5, 6)) >>> result_graph.edges() EdgeView([(1, 2), (2, 3), (4, 5), (5, 6)]) See Also -------- union disjoint_union_all NcB|Sfd}tj||S)Nc|SN)xprefixs ^/var/www/django_project/virt/lib/python3.12/site-packages/networkx/algorithms/operators/all.pylabelz,union_all..add_prefix..labelLsXaS> !)nx relabel_nodes)graphrrs ` r add_prefixzunion_all..add_prefixHs' >L "u--rc36K|]\}}||ywrr).0Gnamers r zunion_all..Rs EgajD! Esr*All graphs must be directed or undirected.)All graphs must be graphs or multigraphs.zThe node sets of the graphs are not disjoint. Use `rename` to specify prefixes for the graphs or use disjoint_union(G1, G2, ..., GN).Tdatakeysr"z'cannot apply union_all to an empty list)setrrzip enumeratenodes __class__ is_directedr NetworkXError is_multigraph isdisjointrupdateadd_nodes_fromadd_edges_fromedges ValueError)r renameR seen_nodesir G_nodes_setrs @rrr skt AJ.66$< (F EVV1D EF&! 1!''l 6 A ]]_  /""#OP P __ !//"3 3""#NO O&&{3""3  k!  qww d+, -.__->AGGDG )AGGQUGDV ' . yBCC Hrc.d}t||}|S)adReturns 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. NetworkXError In case of mixed type graphs, like MultiGraph and Graph, or directed and undirected graphs. Examples -------- >>> G1 = nx.Graph([(1, 2), (2, 3)]) >>> G2 = nx.Graph([(4, 5), (5, 6)]) >>> U = nx.disjoint_union_all([G1, G2]) >>> list(U.nodes()) [0, 1, 2, 3, 4, 5] >>> list(U.edges()) [(0, 1), (1, 2), (3, 4), (4, 5)] Notes ----- For operating on mixed type graphs, they should be converted to the same type. 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. c3lKd}|D])}tj|||t|z }+yw)Nr) first_label)rconvert_node_labels_to_integerslen)r r:rs ryield_relabeledz+disjoint_union_all..yield_relabeleds;  "A44QKP P 3q6 !K "s24)r)r r=r4s rrrqsV" /&)*A Hrcfd}t|D]\}}|dk(r|j}nl|j|jk7rtjd|j |j k7rtjd|j j|j |j|jd|j|j r|jddn|jd| td|S) aUReturns 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. NetworkXError In case of mixed type graphs, like MultiGraph and Graph, or directed and undirected graphs. Examples -------- >>> G1 = nx.Graph([(1, 2), (2, 3)]) >>> G2 = nx.Graph([(3, 4), (5, 6)]) >>> C = nx.compose_all([G1, G2]) >>> list(C.nodes()) [1, 2, 3, 4, 5, 6] >>> list(C.edges()) [(1, 2), (2, 3), (3, 4), (5, 6)] Notes ----- For operating on mixed type graphs, they should be converted to the same type. 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. Nrrr Tr!r#z)cannot apply compose_all to an empty list) r'r)r*rr+r,rr.r/r(r0r1r2)r r4r6rs rrrsT A&!  1 6 A ]]_  /""#OP P __ !//"3 3""#NO O qww d+, -.__->AGGDG )AGGQUGDV    yDEE Hr)r r cd}t|D]#\}}t|j}t|j}|j sS|j r"|j dt|Dn!|j dt|D|dk(r|j}|}|}|j |j k7rtjd|j |j k7rtjd|z}|z}&| td|j|j|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. NetworkXError In case of mixed type graphs, like MultiGraph and Graph, or directed and undirected graphs. Notes ----- For operating on mixed type graphs, they should be converted to the same type. Attributes from the graph, nodes, and edges are not copied to the new graph. The resulting graph can be updated with attributes if desired. For example, code which adds the minimum attribute for each node across all graphs could work. >>> g = nx.Graph() >>> g.add_node(0, capacity=4) >>> g.add_node(1, capacity=3) >>> g.add_edge(0, 1) >>> h = g.copy() >>> h.nodes[0]["capacity"] = 2 >>> gh = nx.intersection_all([g, h]) >>> new_node_attr = { ... n: min(*(anyG.nodes[n].get("capacity", float("inf")) for anyG in [g, h])) ... for n in gh ... } >>> nx.set_node_attributes(gh, new_node_attr, "new_capacity") >>> gh.nodes(data=True) NodeDataView({0: {'new_capacity': 2}, 1: {'new_capacity': 3}}) Examples -------- >>> G1 = nx.Graph([(1, 2), (2, 3)]) >>> G2 = nx.Graph([(2, 3), (3, 4)]) >>> R = nx.intersection_all([G1, G2]) >>> list(R.nodes()) [2, 3] >>> list(R.edges()) [(2, 3)] Nc3.K|] \}}}|||fywrr)ruvks rrz#intersection_all..+s"NAqAq!9"Nsc3*K|] \}}||f ywrr)rrArBs rrz#intersection_all..-s"HdaAq6"Hsrrr z.cannot apply intersection_all to an empty list)r'r%r(r1r*r,r.listr)rr+r2r/r0)r r4r6rr7 G_edges_setnode_intersectionedge_intersections rrrs9v A&!-1!''l !''l }} """NDrNs # PDQc Rc LDQ2 R2 jDQ> R> B48W 9W r