<< NL_G_ParametersUpdateNE NL_G: Graph NL_G_Periphery >>

NARVAL >> NL_G: Graph > NL_G_Path2Nodes

NL_G_Path2Nodes

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

Calling Sequence

[N] = NL_G_Path2Nodes(P,G)

Arguments

P :

List of edges.

G :

Graph.

N :

List of nodes.

Description

NL_G_Path2Nodes transforms the list of edges P of the graph G into the corresponding list of nodes N. If there is a path following each successive links of P, then the corresponding vector of successive nodes N is generated. Otherwise N 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]=NL_G_MakeGraph(name,node_number,tail,head,node_x,node_y);//generation of a topology with 3 nodes
ind=1;//window index
f=NL_G_ShowGraphNE(g,ind);//graph visualization
p=[1 2];//liste of edges
[ns]=NL_G_Path2Nodes(p,g)//application of NL_G_Path2Nodes

Dependency

NL_F_ReverseVector

Report an issue
<< NL_G_ParametersUpdateNE NL_G: Graph NL_G_Periphery >>