JUNG library has 4 Community Detection (Community Structure) algorithms implemented including Girvan–Newman algorithm (EdgeBetweennessClusterer.java)
https://github.com/jrtom/jung/tree/master/jung-algorithms/src/main/java/edu/uci/ics/jung/algorithms/cluster Girvan–Newman algorithm paper http://www.santafe.edu/media/workingpapers/01-12-077.pdf ------------------------------- iGraph has 7 algorithms implemented including InfoMap and Louvain but lic is written in C/C++ http://www.r-bloggers.com/summary-of-community-detection-algorithms-in-igraph-0-6/ On Wed, Mar 9, 2016 at 10:40 PM, Alexander Pivovarov <apivova...@gmail.com> wrote: > Is there Graph Partitioning impl (e.g. Spectral ) which can be used in > Spark? > I guess it should be at least java/scala lib > Maybe even tuned to work with GraphX >
