Compute the diameter of a graph from its enhanced routing table.
[D] = NL_G_Diameter(R)
Enhanced routing table.
Graph diameter.
NL_G_Diameter computes the graph diameter D 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 diameter of a graph is the maximal hop distance between two nodes. As a consequence, the path hop length between any two randomly selected nodes is smaller than D (WIKIPEDIA).
[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 [d]=NL_G_Diameter(rt1)//application of NL_G_Diameter | ![]() | ![]() |