Algorithmic recruitment with GitHub

Neat! I'm attempting to generate a ranking for Seattle now. <i>[Edit: Nevermind, this Java newbie got bored trying to figure out jars and classpaths.]</i> I also didn't realize before that you could find users by their most-used language:<p><a href="http://github.com/search?type=Users&#38;language=python&#38;q=location:seattle&#38;repo=&#38;langOverride=&#38;x=9&#38;y=18&#38;start_value=1" rel="nofollow">http://github.com/search?type=Users&#38;language=python&#38;...</a><p>...and GitHub's own results are ranked by total number of followers, which gives a simpler version of this article's "connectedness" measurement.

Why betweenness centrality and not eigenvector centrality?

This is awesome.<p>The full lists for SF and London are here: <a href="http://github.com/mattb/flotsam/tree/master/github-recruitment" rel="nofollow">http://github.com/mattb/flotsam/tree/master/github-recruitme...</a><p>Looks like I'm languishing at #27 in the London list, better get back to work..

This led me to the JUNG Java library, which looks pretty cool. Thinking it could be fun to play with this in Clojure.

If it becomes more common, we might see GitHub being gamed or spammed by people trying to create artificial networks.