algorithm - Clustering nodes on a graph -


say have weighted, undirected graph x vertices. i'm looking separate these nodes clusters, based on weight of edge between each connected vertex (lower weight = closer together).

i hoping use algorithm k means clustering achieve this, seems k means requires data in @ least 2d space, while have weights of each edge go from.

is there way cluster nodes of weighted graph together? don't have preference whether need specify number of clusters or not.

i suspect i'm missing relatively simple here, rather late.

i've considered whether need traverse graph, , each node find y closest immediate neighbours, seems simple.

edit: apologies: more specific: graph isn't large (around 150 vertices, maximum), , not complete. i'm using python.


Comments

Popular posts from this blog

ubuntu - PHP script to find files of certain extensions in a directory, returns populated array when run in browser, but empty array when run from terminal -

php - How can i create a user dashboard -

javascript - How to detect toggling of the fullscreen-toolbar in jQuery Mobile? -