Аннотация:The paper presents new versions of modularity measure for directed weighted graphs
with overlapping communities. We consider several approaches to computing modularity and
try to extend them. Taking into account computational complexity, we suggest two parallelized
extensions which are scalable to large graphs (more than 10^4 nodes).