Perform the shortest path between two network nodes in respect with the Flood algorithm.
[p] = NARVAL_R_Flood(g,ne,nr,TTL)
network graph.
source node.
destination node.
Flood Time-To-Live.
shortest path between ne and nr.
NARVAL_R_Flood calculates the shortest path between the source node ne and the destination node nr of the graph g.
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. N=length(g.node_x);//real network size nl=length(g.head);//quantity of network links [ne,nr]=NARVAL_F_Random_i_j(N);//selection of two distinct nodes TTL=10;//Time-To-Live update [path]=NARVAL_R_Flood(g,ne,nr,TTL);//application of NARVAL_R_Flood p=NARVAL_G_Nodes2Path(path,g);//links of the shortest path EC=ones(1,nl);//display the path between i and j: edge color EB=2*ones(1,nl);//edge width EC(p)=5; EB(p)=5; D=5*ones(1,N);//node border D(path)=10; g.node_border=D; g.edge_color=EC; g.edge_width=EB; ind=1;//window index f=NARVAL_G_ShowNodesIndex(g,ind);//graph visualization ne nr path | ![]() | ![]() |
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