Extra Code

Compiling GUESS

Newman's fast clustering algorithm

See Newman, MEJ (2004) Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133. doi:10.1103/PhysRevE.69.066133

Example usage: 
#get cluster support matrix (dendrogram) using default edge weight field name ("weight"),
#  for all numbers of clusters down to 2
# this is relatively slow, but only needs to be done once
supp=newmanCluster()
#cut that dendrogram at the level that gives us 10 clusters
# this is fast, so you can explore different numbers of clusters quickly
cl=cutree(supp,10)
for z in cl:
  z.color=randomColor() #colour the clusters