Weight a network graph.
[go] = NARVAL_G_EdgeLength(g)
network graph.
output graph.
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.
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