Extract the largest connex component of a network graph.
[go] = NARVAL_G_GraphConnex(g)
network graph.
output graph.
NARVAL_G_GraphConnex extracts the largest connex component go of the network graph g. As a matter of course a network must be connex as its nodes should be reachable from its structure.
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