<< NARVAL_G_OriginalGraph NARVAL NARVAL_G_PeripheryERT >>

NARVAL >> NARVAL > NARVAL_G_Path2Nodes

NARVAL_G_Path2Nodes

Transform a list of links into the corresponding list of nodes.

Calling Sequence

[ns] = NARVAL_G_Path2Nodes(p,g)

Parameters

p :

list of links.

g :

network graph.

ns :

list of nodes.

Description

NARVAL_G_Path2Nodes transforms the list of links p of the graph g into the corresponding list of nodes ns. If there is a path following each successive links of p, then the corresponding vector of successive nodes ns is generated. Otherwise ns is empty.

Examples

name='network';//graph name
node_number=3;//graph size
tail=[2 3 3];//links parameters
head=[1 1 2];
node_x=[100 700 200];//nodes parameters
node_y=[200 800 600];
[g]=NARVAL_G_MakeGraph(name,node_number,tail,head,node_x,node_y);//generation of a topology with 3 nodes
ind=1;//window index
f=NARVAL_G_ShowNodesEdges(g,ind);//graph visualization
p=[1 2];//liste of edges
[ns]=NARVAL_G_Path2Nodes(p,g);//application of NARVAL_G_Path2Nodes
ns

Dependency

NARVAL_F_RVector

Authors

Foued Melakessou

Contact

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

Home Page


<< NARVAL_G_OriginalGraph NARVAL NARVAL_G_PeripheryERT >>