[igraph] graph partitioning in K groups

[Claudio Martella]

Hello,

I need to partition a weighted undirected graph topologically in a set
of K groups, something like k-means. all i can find is
community-detection without the possibility to specify K.
Can anybody give me a reference for a way of doing this in igraph or
in case to an algorithm that does so I can implement myself?

thanks!

-- 
   Claudio Martella
  address@hidden