<< NARVAL_G_ForceBasedA NARVAL NARVAL_G_GraphConnexInd >>

NARVAL >> NARVAL > NARVAL_G_GraphConnex

NARVAL_G_GraphConnex

Extract the largest connex component of a network graph.

Calling Sequence

[go] = NARVAL_G_GraphConnex(g)

Parameters

g :

network graph.

go :

output graph.

Description

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.

Examples

n=50;//network size
L=1000;//network square area side
dmax=100;//locality radius
[g]=NARVAL_T_Locality(n,L,dmax);//generation of a random topology in respect with the Locality method.
[g1]=NARVAL_G_GraphConnex(g);//application of NARVAL_G_GraphConnex
i1=1;//window index
i2=2;//window index
NARVAL_G_ShowGraph(g,i1);//graph visualization
NARVAL_G_ShowGraph(g1,i2);//graph visualization

Dependency

NARVAL_G_Connex, NARVAL_F_RVector, NARVAL_G_NodeNeighbors, NARVAL_G_MakeGraph, NARVAL_G_EdgeLength

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_ForceBasedA NARVAL NARVAL_G_GraphConnexInd >>