Neaveru

I’ve been playing around with graphviz a little bit.
It’s an interesting application that uses some algorithms I’ve been reading up on to graph different nodes in either a directed or undirected graph (and a bunch of other features that I haven’t played around with).

I thought that maybe I could use it to plot the relationship of friends in a digg story. Works fine for stories with only a few diggs… not so well with any more than 30 or 40.
For the uninitiated, Digg gives members the ability to befriend other members. However, unlike facebook, myspace and the like, the other person doesn’t have to befriend you back. So, person A can have B as a friend, but not necessarily vice-versa.

So, I got a nice looking graph for a story with 30 people, but it was sort of boring. There was a small cluster of about 5 people who were friends with each other, but the rest were pretty much separate. So I tried a larger story, with 120 diggs. Not a good idea.
The result is a 1.5 mb file that doesn’t say anything at all.

For your amusement, I’ve uploaded it here. Click on the fuzziness below:

WARNING: 1.3MB