Return the union of all graphs
The graphs must be disjoint, otherwise an exception is raised.
Parameters : | graphs : list of graphs
rename : bool , default=(None, None)
name : string
|
---|---|
Returns : | U : A union of graph with the same type as the first graph. |
See also
union
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 supplied graphs to the union graph. If a graph attribute is present in multiple graphs, then the first graph with that attribute takes priority.