4 ms·
A few years ago I made something similar (http://ratewith.science/ http://ratewith.science/) that only uses bi-directional links, that is pages that both link t
by trishume 9y ago
A few years ago I made something similar (http://ratewith.science/ http://ratewith.science/) that only uses bi-directional links, that is pages that both link to each other, and this gives much more interesting results.
When two Wikipedia pages both link to each other they are usually related in some reasonable way, but unidirectional links give you things like Wikipedia -> California, which only exists because Wikipedia is headquartered in California, a pretty weak connection.
Other than the fact I have it running on an overburdened tiny VPS, my app is also really fast even though I only do a unidirectional BFS because I use a custom in-memory binary format that's mmapped directly from a file that's only 700MB, and a tight search loop written in D.
- trendy12 9y agodfsf
- dingo_bat 9y agoPretty cool!
- mulmen 9y agoOn a scale of The Monty Hall Problem to Manifest Destiny this is a 5!
- cyphar 9y agoMaybe I made a mistake somewhere, but I'm not sure it uses bi-directional links. For a really odd search like GoldenEye -> Abbotsford [1] it uses multiple "special" Wikipedia links that I'm pretty sure wouldn't be bidirectional. [1]: http://ratewith.science/#start=Goldeneye&stop=abbotsford http://ratewith.science/#start=Goldeneye&stop=abbotsford
- trishume 9y agoYah so what it does is try to find a path with bidirectional links, and then if it can't it tries to find a unidirectional path. You can tell which one it did by whether the numbers in the path have a pulsing glow animation, that particular path does not.
- amelius 9y agoPerhaps you could refine that by also allowing double backward hops, triple backward hops etc.