[f] WBBC = HBC :)
Heuristic BC for different graphs
Compute Component Tree Weights - Bugs fixed- Component-vertex pair (B, v): minus 1 unit more- Vertex-component pair (v, B): initialize size = 0
Results: Correct even for Sample 4. Still not correct for Ninux Graph.
More examples to debug the Computing Component Tree Weights - I found problems for the simple4.edges
Debugging the Algorithm 1: Compute Component Tree Weights [Puzis 2012]
Done with creating the communication importance matrix (or Traffic Matrix). This is necessary in calculating betweenness centrality later
Heuristic Betweenness for Structurally Equivalence Class
[r] Heuristic Betweenness for bi-connected components
Heuristic betweenness centrality - block cut tree