Clustering analysis of a weighted graph My data consists of a large weighted undirected graph of $n$ nodes. I need to group the nodes into $m$ clusters ($m &lt; n$), such that nodes in a cluster are connected with heavy weights. What algorithms are available for this problem?
Some keywords and starting references:


Spectral clustering
Community detection
Walktrap and the Louvain algorithms work very well with weighted undirected graphs.
You may find them in most modern graph libraries.