I have an undirected graphic. I am looking for cluster algorithms, preferably distributed to partition the nodes of these graphs. I need algorithms that group every given graph so that the number of nodes in each cluster is close to K (a given parameter). in addition, I need the subgraphs generated by each cluster. It is desirable that the distances of the nodes within the cluster are as small as possible (but this goal is of lesser importance, the main goal being the simplicity of the algorithm).