Toby is doing some weird sort of research (all I know it involves representing propositional logic forumulas as graphs) and asked me a question about Dijkstra's algorithm (which I get to be the expert on, because I'm the networks TA) and together we discovered Dial's implementation (warning: tiny text!). That's pretty neat.
I know very close to nothing about algorithms.
Speaking of algorithms, I found my copy of the LJ friends export Brad did a while back. It's from mid-2003, and I think there are 14 million edges in it. The datafile obfuscates userids into random integers, but they're unfortunately 32-bit integers and OCaml* can only do 31-bit integers quickly on x86. So I wrote a C program to reprocess them down to smaller integers (there's only around a million nodes, after all) and produce a binary format and the file is still like a hundred megs.
And from there, I don't know what to do with it. I wanna do popularity contests or whatever but without userids it's not too interesting.
* Of course I'm using OCaml. Duh. :P
