An implementation for the graph clustering algorithm, TopGC can be downloaded here.
The program is written in Java, and takes a binary, indexed, graph file as input. A script to
convert a tab-deliminated graph file into the proper input format is included in the download.
Further information on the graph formats can be found here.
To run the program, the usage follows:
java -jar TopGC.jar -i inputGraph [-d directed] [-p mostProm] [-max maxClusterSize] [-min minClusterSize] [-lambda overlap] [-l wordLength] [-m m] [-w w] [-trials trials]
Further information is contained in the README file within the download.