Extract the set of disjoint connex components of a network graph.
[nc,compo] = NARVAL_G_Connex(g)
network graph.
size vector of each connex component.
vector of nodes per connex component.
NARVAL_G_Connex extracts the set of all disjoint connex components (s) of the network graph g. As a matter of course a network must be connex as its nodes should be reachable from its structure. In fact, the first connex component has a size of nc(1). Thus it is composed by nodes compo(1:nc(1)). Afterwards the second connex component has a size of nc(2). Thus it is composed by nodes compo(nc(1)+1:nc(1)+1+nc(2)), etc. Thus we have nc=[nc(1),nc(2),..,nc(s)] and compo=[NC1{1:nc(1)},NC2{1:nc(2)},..,NCS{1:nc(s)}] with NCi=compo(1+nc(1)+nc(2)+...+nc(i-1):1+nc(1)+nc(2)+...+nc(i)).
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