<< NARVAL_G_EdgeDataFields NARVAL NARVAL_G_EdgeNumber >>

NARVAL >> NARVAL > NARVAL_G_EdgeLength

NARVAL_G_EdgeLength

Weight a network graph.

Calling Sequence

[go] = NARVAL_G_EdgeLength(g)

Parameters

g :

network graph.

go :

output graph.

Description

NARVAL_G_EdgeLength transforms the network graph g into the weighted graph go where the Euclidian distance between the extreme nodes of edges is used. These weights are stored in g.edge_length. They are needed during the paths performance between network entities.

Examples

n=80;//network size
L=1000;//network square area side
dmax=100;//locality radius
[g]=NARVAL_T_LocalityConnex(n,L,dmax);//generation of a random topology in respect with the Locality method. 
ind=1;//window index
f=NARVAL_G_ShowGraph(g,ind);//graph visualization
g.edge_length=[]//initialization with an empty vector
[g]=NARVAL_G_EdgeLength(g);//application of NARVAL_G_EdgeLength
g.edge_length

Dependency

NARVAL_G_LongueurArc

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_EdgeDataFields NARVAL NARVAL_G_EdgeNumber >>