disjoint_union_all(graphs)
This operation forces distinct integer node labels starting with 0 for the first graph in the list and numbering consecutively.
It is recommended that the graphs be either all directed or all undirected.
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.
List of NetworkX graphs
If :None:None:`graphs` is an empty list.
Returns the disjoint union of all graphs.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.operators.all.union_all
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them