a 1bT@sFdZddlmZddlZgdZdddZdd Zd d Zd d Z dS)zOperations on many graphs. ) zip_longestN) union_all compose_alldisjoint_union_allintersection_allNcst|}|std|dtfdd|Dr7zunion_all..)All graphs must be graphs or multigraphs.cs$dur |Sfdd}t||S)Ncs$t|tr|}n t|}|Sr) isinstancestrrepr)xnameprefixrrlabel?s   z,union_all..add_prefix..label)nxZ relabel_nodes)graphrrrrr add_prefix;s zunion_all..add_prefixcsg|]\}}||qSrr)r r r)rrr Hrzunion_all..css|]}t|VqdSr)lenr rrrrJrz-The node sets of the graphs are not disjoint.z[Use appropriate rename=(G1prefix,G2prefix,...,GNprefix)or use disjoint_union(G1,G2,...,GN).Tdatakeysr")list ValueErroranyr NetworkXErrorrsumr setunion __class__rupdateadd_nodes_fromnodesr add_edges_fromedges)graphsrenameRr r)rrrr s0'  "rcCszt|}|stddg}|ddD]}|t||dq&ddt||D}t|}|D]}|j|jqb|S)aReturns 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 : list List 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. z0cannot apply disjoint_union_all to an empty listrNcSsg|]\}}tj||dqS)) first_label)rZconvert_node_labels_to_integers)r r r6rrrrsz&disjoint_union_all..)r%r&appendr ziprrr-)r2Z first_labelsr Z relabeledr4rrrrgsrcst|}|std|dtfdd|Dr.rTr!r#) r%r&r'rr(r,rr-r.r/r r0r1)r2r4r rr rrs" rcst|}|std|dtfdd|Dr.rcSsg|]}t|jqSr)r*r/r rrrrrz$intersection_all..cSsg|]}t|jddqS)T)r$r*r1r rrrrrcSsg|]}t|qSrr9r rrrrr) r%r&r'rr(r* intersectionr,r.r r0)r2Znode_intersectionr4Z edge_setsZedge_intersectionrr rrs    r)r) __doc__ itertoolsrZnetworkxr__all__rrrrrrrrs  ^/8