title: Can I use k-means to cluster a non-complete graph?
body: <p>I want to cluster a <strong>connected undirected graph</strong> (not a complete graph) by using <strong>k-means</strong> clustering algorithm. I only saw k-means is used in a complete graph, but i'm not sure whether there is another way i can apply it in a non-complete graph or not.</p>
  
  <p>So, is there anyone here know about this? And, if k-means cannot be applied in the connected undirected graph, which algorithm is good for clustering this kind of graph?</p>
  
  <p>Thanks in advance!!!</p>