History | View | Annotate | Download (2.3 KB)

[HBCW] Heuristic Betweenness Centrality for weighted graph

[f] Count how many times a certain value (not key) appearing in a Map.

[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.

[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.