union(G, H, rename=(None, None), name=None)
Graphs G and H must be disjoint after the renaming takes place, otherwise an exception is raised.
To force a disjoint union with node relabeling, use disjoint_union(G,H) or convert_node_labels_to integers().
Graph, edge, and node attributes are propagated from G and H to the union graph. If a graph attribute is present in both G and H the value from H is used.
A NetworkX graph
Node names of G and H 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".
Specify the name for the union graph
This is deprecated and will be removed in version v3.0.
Return the union of graphs G and H.
>>> G = nx.Graph([(0, 1), (0, 2), (1, 2)])
... H = nx.Graph([(0, 1), (0, 3), (1, 3), (1, 2)])
... U = nx.union(G, H, rename=("G", "H"))
... U.nodes NodeView(('G0', 'G1', 'G2', 'H0', 'H1', 'H3', 'H2'))
>>> U.edges EdgeView([('G0', 'G1'), ('G0', 'G2'), ('G1', 'G2'), ('H0', 'H1'), ('H0', 'H3'), ('H1', 'H3'), ('H1', 'H2')])See :
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.operators.binary.union
networkx.algorithms.operators.binary.full_join
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