Return the disjoint union of graphs G and H, forcing distinct integer node labels.
Parameters : | G,H : graph
|
---|---|
Returns : | U : A union graph with the same type as G. |
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.
The nodes of G are relabeled 0 to len(G)-1, and the nodes of H are relabeld len(G) to len(G)+len(H)-1.