History | View | Annotate | Download (9.47 KB)
[HBCW] Heuristic Betweenness Centrality for weighted graph
[milestone] HBC - working for unweighted graph. The script.sh generates the output and the score for BC and HBC.
[f] Skeleton for HBC calculation. For each sub-component, now we are using the standard function boost::brandes_betweenness_centrality() to get their BC scores.
[HBC] BC score for Sub-Component.
[R] Working: Refactor Heuristic BCC version. Now all the Link Weight and Traffic Matrix for each Sub-Component are correct. Also, we have the Graph object for each Sub-Component.
[cpp, r] Done with creating subgraph for each sub component
[cpp] Heuristic - Jan 14 - output graph