<< NARVAL_G_Spectrum NARVAL NARVAL_G_TreeLeaves >>

NARVAL >> NARVAL > NARVAL_G_SplitEdge

NARVAL_G_SplitEdge

Insert new nodes inside an edge of a graph.

Calling Sequence

[go] = NARVAL_G_SplitEdge(g,e,n)

Parameters

g :

network graph.

e :

edge index.

n :

quantity of new nodes.

go :

output graph.

Description

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.

Examples

[path]=NARVAL_F_NARVALPath();//path to NARVAL module
path=path+'/demos/';//folder path
name='topo_20.topo';//file name
Lxmin=100;
Lxmax=900;
Lymin=100;
Lymax=900;
[g]=NARVAL_T_UploadTopology(path,name,Lxmin,Lxmax,Lymin,Lymax);//graph loading
ind=1;//window index
f=NARVAL_G_ShowEdgesIndex(g,ind);//graph visualization
e=3;//edge index
ns=3;//quantity of new nodes
[go]=NARVAL_G_SplitEdge(g,e,ns);//application of NARVAL_G_SplitEdge
i2=2;//window index
f2=NARVAL_G_ShowGraph(go,i2);//graph visualization

Dependency

NARVAL_G_DeleteEdges, NARVAL_G_EdgeLength

Authors

Foued Melakessou

Contact

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

Home Page


<< NARVAL_G_Spectrum NARVAL NARVAL_G_TreeLeaves >>