<< NARVAL_R_CongestionMap NARVAL NARVAL_R_DFS >>

NARVAL >> NARVAL > NARVAL_R_ConnNeighbor

NARVAL_R_ConnNeighbor

Perform the neighborhood of the shortest path between two network nodes of a graph in respect with a routing table.

Calling Sequence

[vs]=NARVAL_R_ConnNeighbor(g,rt,nd,nf,n)

Parameters

g :

network graph.

rt :

routing table.

nd :

emission node.

nf :

destination node.

n :

network size.

vs :

1-hop neighborhood.

Description

NARVAL_R_ConnectionNeighbor performs the 1-hop neighborhood vs of the shortest path between 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.

Examples

[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);
ec=ones(1,nl);
ec(p)=2;
eb=2*ones(1,nl);
eb(p)=3;
nc=ones(1,n);
nb=5*ones(1,n);
nc(vs)=5;
nb(vs)=10;
g.node_border=nb;
g.node_color=nc;
g.edge_width=eb;
g.edge_color=ec;
ind=1;
f=NARVAL_G_ShowGraph(g,ind);

Dependency

NARVAL_R_PathERT, NARVAL_G_NodeNeighbors

Author

http://wwwen.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust

Contact

<< NARVAL_R_CongestionMap NARVAL NARVAL_R_DFS >>