Merge two graphs in respect with a defined edge between two nodes.
[g] = NARVAL_G_Union(n1,g1,n2,g2)
first graph.
node index.
second graph.
node index.
output graph.
NARVAL_G_Union merges the 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.
The graph g1={N1,N2,..,N19} is now connected to the graph g2={N20,N21,N22} in respect with the new edge between the nodes N15 and N20.
Dr. Foued Melakessou
Research Associate
Interdisciplinary Centre for Security, Reliability and Trust
Room F106
University of Luxembourg
6, rue Coudenhove Kalergi
L-1359 Luxembourg-Kirchberg
E-mail: foued.melakessou@uni.lu
Tel: (+352) 46 66 44 5346