Merge two graphs in respect with a defined edge between two nodes.
[G] = NL_G_GraphUnion(N1,G1,N2,G2)
Node index.
First graph.
Node index.
Second graph.
Output graph.
NL_G_GraphUnion merges the two graphs and
into a single entity G. To achieve this fusion, a new edge is created between the node
of the graph
and the node
of the graph
.
The graph is now connected to the graph
in respect with the new edge between the nodes
and
.