<< NL_R_AODVRouteRequestIt NL_R: Routing NL_R_ARCCongestionDetect >>

NARVAL >> NL_R: Routing > NL_R_ARC

NL_R_ARC

Compute the ARC algorithm on a graph.

Calling Sequence

[M,R] = NL_R_ARC(G,S,H1,H2)

Arguments

G :

Graph.

S :

Source node.

:

First Heir.

:

Second Heir.

M :

Arc storage matrix.

R :

Vector of sub-root.

Description

NL_R_ARC performs the ARC algorithm on the graph G emitted from the root node S towards its two Heirs and . The list of ARCs are chronologically stored in the matrix M. R provides the list of sub-roots.

Examples

nodx=[600 400 800 300 500 700 900 200 400 600 800 100 300 500 700];
nody=[900 700 700 500 500 500 500 300 300 300 300 100 100 100 100];
he=[1 1 2 2 3 3 4 4 4 5 5 6 6 7 8 8 9 9 9 10 10 10 13 14];
ta=[2 3 4 5 6 7 5 8 9 9 10 7 11 11 9 12 10 13 14 11 14 15 14 15];
n=15;
[g] = NL_G_MakeGraph('ARC',n,ta,he,nodx,nody);
//R A B D C M K L E F J N G H I 
f=NL_G_ShowGraphN(g,1);
s=1;//root node
Heir1=2;
Heir2=3;
[m,sr]=NL_R_ARC(g,s,Heir1,Heir2)//application of NL_R_ARC

Dependency

NL_R_ARCFirstARC, NL_F_RemoveVecIndexes, NL_R_ARCSubRoot, NL_R_ARCSubRootARC, NL_F_RandInt1n

Report an issue
<< NL_R_AODVRouteRequestIt NL_R: Routing NL_R_ARCCongestionDetect >>