Perform the betweenness of a node inside a graph.
[B,S]=NARVAL_G_Betweenness(ERT,l)
enhanced routing table.
node index.
betweeness.
betweeness coefficients.
NARVAL_G_Betweenness performs the betweeness B of the node l inside a graph represented by its enhanced routing table ERT. Let Sij be the number of shortest paths between nodes i and j. Let Sijl be the number of shortest paths between i and j going through the node l. Its betweenness is B={sum i j}{Sijl/Sij}. B is normalized by n(n-1) where n is the graph size.
[path]=NARVAL_F_NARVALPath();//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 l=79; [B,S]=NARVAL_G_Betweenness(rt1,l);//application of NARVAL_G_Betweenness B S | ![]() | ![]() |