Perform the neighborhood of the shortest path between two network nodes of a graph in respect with a routing table.
[vs] = NARVAL_R_ConnNeighbor(g,rt,nd,nf,n)
network graph.
routing table.
emission node.
destination node.
network size.
1-hop neighborhood.
NARVAL_R_ConnNeighbor performs the 1-hop neighborhood vs of the shortest path between the two nodes nd and nf inside the network graph g of size n. rt corresponds to the routing table used to calculate the shortest path between the extremal connection nodes.
[path]=NARVAL_F_NARVALPath();//path to NARVAL module path=path+'/demos/';//folder path load(path+'topo_100.graph');//loading of the network graph load(path+'RoutingTables_topo_100.dat','pt','rt1','rt2','rt3','rt4','rt5');//loading of the network routing tables n=100;//network size [nd,nf]=NARVAL_F_Random_i_j(n);//generation of extremal connection nodes [vs]=NARVAL_R_ConnNeighbor(g,rt1,nd,nf,n);//application of NARVAL_R_ConnNeighbor path=NARVAL_R_PathERT(rt1,nd,nf,n);//shortest path extraction between nd and nf p=NARVAL_G_Nodes2Path(path,g);//display the neighborhood nl=length(g.head);//quantity of links ec=ones(1,nl);//edge color ec(p)=2; eb=2*ones(1,nl);//edge width eb(p)=3; nc=ones(1,n);//node color nb=5*ones(1,n);//node border nc(vs)=5; nb(vs)=10; g.node_border=nb; g.node_color=nc; g.edge_width=eb; g.edge_color=ec; ind=1;//window index f=NARVAL_G_ShowNodesIndex(g,ind);//graph visualization | ![]() | ![]() |
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