<p>I finally went for the <a href="https://arxiv.org/pdf/0803.0476.pdf" rel="nofollow noreferrer">Louvain method</a> since it was the best fit for my problem and also there was a <a href="http://perso.crans.org/aynaud/communities/" rel="nofollow noreferrer">library</a> already implemented that speaks with Networkx.</p>
How to cluster a highly dense graph
<p>I have this highly dense graph I want to cluster, I was wondering which is the best algorithm for this case scenario. I'd like to generate a considerable amount of subgroups.</p>

<p>I'm using Python's library <a href="https://networkx.github.io/" rel="nofollow noreferrer">Networkx</a> to generate the graph.</p>

<p><a href="https://i.stack.imgur.com/qJqRe.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/qJqRe.png" alt="my graph"></a></p>