jeffgreenca/codesort

faster graph algorithm implementation

Closed this issue 5 years ago · 1 comments

jeffgreenca commented 5 years ago

Look at alternatives to networkx implementation that may be faster for calculating betweenness centrality on large repositories.

jeffgreenca commented 5 years ago

ideas

igraph betweenness
networkit https://github.com/kit-parco/networkit
graph-tool (made some attempt on a working branch)
for CUDA approach this exists https://github.com/gunrock/gunrock/blob/master/python/betweenness_centrality.py
port to golang with something like https://godoc.org/gonum.org/v1/gonum/graph/network and run a speed comparison