#12 Group Betweenness Implementation

[Anonymous]

Implementation of the successive group betweenness algorithm by Puzis et. al (2007): 'Fast algorithm for successive
* computation of group betweenness centrality'. The implementation works with undirected weighted graphs. The extension to directed should be straightforward, but I didn't have time to test it thoroughly. To implement it, I had to also extend the Dijkstra's shortest path implementation, so that it also counts the shortests paths. Attached are also some basic unit tests.

[Nobody/Anonymous]

sources and unit tests of implementation of group betweenness centrality algo