hzgand/brandes-centrality

Algorithms for computing the number of shortest paths between two verticies in connected graphs. Adapted from methods utilized by Brandes to calculate betweenness centrality.

C++