(no subject)
Nov. 28th, 2001 01:05 pmYou know what would be neat? A LJ Baconizer function, which would find the shortest link in terms of friends from an arbitrary LJ user A to an arbitrary LJ user B. Put, say,
suppafly in one end and
zamiel in the other, and see what the minimum number of hops required to link them both together is.
Of course, that would probably require a bit of processing time...but still, I think it'd be kind of neat. (If LJ already has something like that, let me know? :)
Of course, that would probably require a bit of processing time...but still, I think it'd be kind of neat. (If LJ already has something like that, let me know? :)