c# - Louvain modularity implementation -

i want use louvain modularity algorithm in order find cliques in graphs. couldn't find library can in c#. know if such library exists , if not there open source graph library in c# easy implement such algorithm in. moreover, if there open source library in java or c++ implement louvain modularity algorithm know also. if knows please share. thank you!

the original article implementation in c++:

• https://perso.uclouvain.be/vincent.blondel/research/louvain.html
• https://sites.google.com/site/findcommunities/

it implemented in open source libraries such igraph: http://igraph.org/c/doc/igraph-community.html#igraph_community_multilevel