Fear my time-wasting skills
Jan. 23rd, 2005 04:34 pmI went and, again, by hand, figured out all the maximal complete subgraphs that include me of the LJ mutual friends graph, the LJ friends-either-way graph, and the LJ friends XOR graph.
(I did, a while ago, write a program to calculate this. It worked when I tried it on a small graph, of 5 vertices. When I tried it on the digraph of me-and-all-my-friends-and-friendofs, however, it took up enough memory to slow the computer down to the point that I decided to just give it a hard shutdown. I should really try to figure out how much memory these things are going to use before I run them, I suppose... anyway, I never got around to improving it.)
I will not annoy you all with the results, just one interesting thing: I think this is the first time I have seen more than a K2 in the XOR graph. Specifically,
sidepocket_pro has both me and
xplodingpigeon as friends, but neither of us has him as a friend, and I have
xplodingpigeon as a friend, but he does not have me as a friend.
-Sniffnoy
--
May contain traces of nuts.
(I did, a while ago, write a program to calculate this. It worked when I tried it on a small graph, of 5 vertices. When I tried it on the digraph of me-and-all-my-friends-and-friendofs, however, it took up enough memory to slow the computer down to the point that I decided to just give it a hard shutdown. I should really try to figure out how much memory these things are going to use before I run them, I suppose... anyway, I never got around to improving it.)
I will not annoy you all with the results, just one interesting thing: I think this is the first time I have seen more than a K2 in the XOR graph. Specifically,
-Sniffnoy
--
May contain traces of nuts.
no subject
Date: 2005-01-24 10:12 pm (UTC)