Question: What's a quick and dirty way to do community detection on a small trimmed knn graph?

Hey folks. I have a trimmed kNN graph with about 300 nodes and 1500 edges. Now, I know I could use R/iGraph or the modularity calculation in Gephi to do community detection, but I don't want to.

I was wondering...anyone have some recommendations for the hackiest, easiest way to do community detection on the graph? Doesn't have to be perfect...doesn't even have good.