<< NL_R_ARCCursor NL_R: Routing NL_R_ARCFirstARC >>

NARVAL >> NL_R: Routing > NL_R_ARCFirstARC

NL_R_ARCFirstARC

Compute the first ARC of the ARC algorithm.

Calling Sequence

[M1,M2,N1,N2,A,P1,P2] = NL_R_ARCFirstARC(G,S,H1,H2)

Arguments

G :

Graph.

S :

Source node.

:

First Heir.

:

Second Heir.

:

Discovery packet storage matrix related to H1.

:

Discovery packet storage matrix related to H2.

:

Final node of the sub-ARC generated from H1.

:

Final node of the sub-ARC generated from H2.

A :

First ARC.

:

First sub-ARC.

:

Second sub-ARC.

Description

NL_R_ARCFirstARC computes the first ARC of the ARC algorithm on the graph G emitted from the root node S towards its two Heirs and .

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;
[mat1,mat2,nod1,nod2,arc,p1,p2]=NL_R_ARCFirstARC(g,s,Heir1,Heir2)//application of NL_R_ARCFirstARC

Dependency

NL_R_ARCRootInit, NL_F_DistanceNiNj, NL_R_ARCRootIter, NL_R_PredecessorRoute, NL_G_Nodes2Edge

Report an issue
<< NL_R_ARCCursor NL_R: Routing NL_R_ARCFirstARC >>