Insert new nodes inside an edge of a graph.
[go] = NARVAL_G_SplitEdge(g,e,n)
network graph.
edge index.
quantity of new nodes.
output graph.
NARVAL_G_SplitEdge inserts a set of n new nodes linealy distributed between the extremal nodes of the selected edge e of the graph g. The output graph is stored in go.
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