Extract a tree from a network topology.
[gt] = NARVAL_R_TreeExtraction(g,r,pred)
graph.
root node.
predecessor vector.
tree.
NARVAL_R_TreeExtraction performs the extraction of the tree gt defined by its predecessor vector pred generated from the root r of the network topology g.
n=150;//network size L=1000;//network square area side dmax=150;//Locality radius [g]=NARVAL_T_LocalityConnex(n,L,dmax);//generation of a topology in respect with the Locality method [r,nind]=NARVAL_F_AleaVec(1:length(g.node_x));//selection of the root node dw=5;//display parameter ind=1;//window index [go,v,pred]=NARVAL_R_BFS(g,r,dw,ind);//performance of the tree [gt]=NARVAL_R_TreeExtraction(g,r,pred);//application of NARVAL_R_TreeExtraction iw=2;//window index f=NARVAL_G_ShowNodesIndex(gt,iw);//tree visualization | ![]() | ![]() |
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