cartesian_product(G, H)
The Cartesian product $P$ of the graphs $G$ and $H$ has a node set that is the Cartesian product of the node sets, $V(P)=V(G) \times V(H)$. $P$ has an edge $((u,v),(x,y))$ if and only if either $u$ is equal to $x$ and both $v$ and $y$ are adjacent in $H$ or if $v$ is equal to $y$ and both $u$ and $x$ are adjacent in $G$.
Node attributes in P are two-tuple of the G and H node attributes. Missing attributes are assigned None.
Networkx graphs.
If G and H are not both directed or both undirected.
The Cartesian product of G and H. P will be a multi-graph if either G or H is a multi-graph. Will be a directed if G and H are directed, and undirected if G and H are undirected.
Returns the Cartesian product of G and H.
>>> G = nx.Graph()
... H = nx.Graph()
... G.add_node(0, a1=True)
... H.add_node("a", a2="Spam")
... P = nx.cartesian_product(G, H)
... list(P) [(0, 'a')]
Edge attributes and edge keys (for multigraphs) are also copied to the new product graph
See :The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.operators.product.cartesian_product
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