Could you include Weighted Betweenness Centrality? about graph-benchmarks HOT 2 OPEN

I think to some extent you can given that the Betweenness involves calculating the shortest path between all pair of vertices of a graph. Though the caveat here is that in the benchmark I measured only the unweighted single source shortest pair as opposed to the weighted all pairs shortest problem. Even so, Lightgraphs should be the fastest due to the threaded shortest path implementation with Graphtool and Networkit taking 2nd place.

Will most definitely consider it the next time I am running the benchmark. Especially adding weights to the shortest path problem.

from graph-benchmarks.

Super, thanks! Can't wait to see how it goes :)

from graph-benchmarks.