networkx.algorithms.operators.union
networkx.algorithms.operators.intersection
Enter search terms or a module, class or function name.
Return the disjoint union of graphs G and H, forcing distinct integer node labels.
G,H : graph
A NetworkX graph
Notes
A new graph is created, of the same class as G. It is recommended that G and H be either both directed or both undirected.