Return the disjoint union of graphs, forcing distinct integer node labels.
| Parameters : | graphs : list
|
|---|---|
| Returns : | U : A union of graph with the same type as the first graph. |
Notes
A new graph is created, of the same class as the first graph. It is recommended that the graphs be either all directed or all undirected.