This is a fork of ScoDA, a linear streaming algorithm for community detection, where I am trying to measure the time to find communities on static graphs. It is not clear to how to obtain modularity of communities found. I process the output logs and generate plots using sheets.
