History | View | Annotate | Download (3.74 KB)

Making the parser receiving the input from commandline

[HBCW] Heuristic Betweenness Centrality for weighted graph

[HBC]It's now working with- jsoninfo_topo.json- graph where there are edges that are not included in Bi-Connected Components (for example, in jsoninfo_topo.json

Check whether graph is connected

[milestone] HBC - working for unweighted graph. The script.sh generates the output and the score for BC and HBC.

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

[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

[r] Modularized into parser, utility for code to calculate betweennes