Open tecosaur opened 1 year ago
@olegfafurin let's start with greedy modularity optimization?
I am still interested in implementing Girvan-Newman! I need a week before I can make steady progress, but would be happy to take a crack at it.
Sounds good!
There seems to be a dearth of community detection algorithms in the current Graphs.jl. Hopefully this can be remedied in the future, and to that end I thought I'd list the ones that NetworkX currently has for comparison:
There are also some in iGraphs that I think would be worth having: