- union_all(graphs, rename=())[source]#
Returns the union of all graphs.
The graphs must be disjoint, otherwise an exception is raised.
Iterable of NetworkX graphs
- renameiterable , 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.
- Ua graph with the same type as the first graph in list
graphsis an empty list.
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.