[milestone][HBC] Making HBC work with subtracting bc_inter as described in Puzis 2012 paper.
- Read the input with both csv and space-separated file.- Output values are separated by comma.
Simulation with output both the clock_begin, clock_end
Code to run experiments
Makefile for different targets: arm, mips
[b] HBC doesn't work in QEMU since I miss the "return" statement.
[OpenWrt] Script to move source code, and compile toolchain
[OpenWrt] Script to move graph-parser and compile toolchain into OpenWrt Image with the graph-parse inside.
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.
[f] Adding test
[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] Use reference-to-const for function arguments.
[r] Split into modules
[r] Modularized into parser, utility for code to calculate betweennes
[r] Modularize code
Parse simple graph + JSON graph + calling betweenness centrality
Package to test the boots/graph library
Package to test the boots/lambda library