This is a fork of grappolo, where I am trying to measure the time to find communities on static graphs using the Louvain algorithm, as well as the modularity of communities found. I process the output logs and generate plots using sheets. Note that total time includes clustering time and rebuilding time (aggregation).
wolfram77 / ecp-exagraph--grappolo Goto Github PK
View Code? Open in Web Editor NEWThis project forked from ecp-exagraph/grappolo
OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques
Home Page: https://hpc.pnl.gov/people/hala/grappolo.html
License: BSD 3-Clause "New" or "Revised" License