<< NL_G_ForceBasedAlgo NL_G: Graph NL_G_GraphConnexPart >>

NARVAL >> NL_G: Graph > NL_G_GraphCenter

NL_G_GraphCenter

Return the center of a graph from its enhanced routing table.

Calling Sequence

[C] = NL_G_GraphCenter(R)

Arguments

R :

Enhanced routing table.

C :

Graph center.

Description

NL_G_GraphCenter computes the graph center C in respect with the graph enhanced routing table R. R stores all paths between any couple of distinct nodes within the network. R can be generated with the application of NL_R_RT2ERT on the routing tables created from NL_R_FloodRT, NL_R_DijkstraRT, or NL_R_BellmanFordRT. For a better convenience, we already generated a scenario whith the creation of a graph composed by 100 nodes. We have also performed 5 enhanced routing tables providing multiple paths for each connection between two nodes. The route between the nodes and can be extracted at the line of index where represents the network size. Then for each path stored into a single line, its hop length can be found in the first column, followed by its length and finally the path composed by a list of nodes ([hop length | length | path]). By definition, the set of nodes with minimum eccentricity belong to the graph center (WIKIPEDIA).

Examples

[path]=NL_F_NLPath();//path to NARVAL module
path=path+'/demos/';//folder path
load(path+'RoutingTables_topo_100.dat','pt','rt1','rt2','rt3','rt4','rt5');//loading of the network routing tables
load(path+'topo_100.graph','g');//graph extraction
col=2;//color
b=10;//node border
d=30;//node diameter
ind=1;//window index
[c]=NL_G_GraphCenter(rt1)//application of NL_G_GraphCenter 
[go,f]=NL_G_HighlightNodes(g,c,col,b,d,ind);//graph visualization

Dependency

NL_G_Eccentricity

Report an issue
<< NL_G_ForceBasedAlgo NL_G: Graph NL_G_GraphConnexPart >>