Finding interesting paths not through dates or lists is difficult. It would be interesting to develop some heuristic for eliminating them (maybe links per volume?) and do so. I think, at least, it would increase the humor per attempt when searching between random things.
In reply to Re^2: Graph Theory, Perl, and the Six Degrees of Wikipedia (fun paths)
by amarquis
in thread Graph Theory, Perl, and the Six Degrees of Wikipedia
by Starky
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |