Perform the average distance of a graph.
[D] = NL_G_AverageDistance(R)
Enhanced routing table.
Average distance.
NL_G_AverageDistance performs the average distance D of the graph G in respect with its enhanced routing table R. R stores all paths between each 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 graph 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]). The average distance D gives the average length value of all available paths.
[path]=NL_F_NLPath();//path to the 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 rt1(1:10,:)//display of the first 10 paths //[hop length | length | path] //node 1 --> node 1 //node 1 --> node 2 //node 1 --> node 3 //node 1 --> node 4 //node 1 --> node 5 //node 1 --> node 6 //node 1 --> node 7 //node 1 --> node 8 //node 1 --> node 9 //node 1 --> node 9 [d]=NL_G_AverageDistance(rt1)//application of NL_G_AverageDistance | ![]() | ![]() |