Merge two graphs in respect with a defined edge.
[g]=NARVAL_G_Union(n1,g1,n2,g2)
first graph.
node index.
second graph.
node index.
output graph.
NARVAL_G_Union merges two graphs g1 and g2 in a single entity g. To achieve this fusion, a new edge is created between the node n1 of the graph g1 and the node n2 of the graph g2.