Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Show HN: Six Degrees of Wikipedia

sixdegreesofwikipedia.com

Post reply on HN
Print view View original

21–30 of 354 posts

Re: Show HN: Six Degrees of Wikipedia

#24

Post by [deleted] »

colemannugent wrote: post #16

This makes the "How many clicks to Hitler" game much faster. For those uninitiated, the game was to click the "Random Article" link in the sidebar and count how many links it took to get to Hitler. It is really interesting to see just how big of an event WWII was. Every country article has a section on their involvement or why they were not involved. After playing with it more, this is pretty fun. I vote that a "degr…

[deleted]

Re: Show HN: Six Degrees of Wikipedia

#25

Post by digi_owl »

tbirrell wrote: post #7

This reminds me of that thing back around 2010 where if you clicked the first* link on any wikipedia page you'd eventually get to the article on philosophy or something. I forget which it was exactly, and I have no idea if it still works, but it was pretty fun back then trying to find a starting article that couldn't find the "philosophy" article. *Non-italicised because of the disambiguation suggestions

https://en.wikipedia.org/wiki/Wikipedia:Getting_to_Philosoph...

https://xkcd.com/903/ < check alt-text.

Re: Show HN: Six Degrees of Wikipedia

#29

Post by jwngr »

jumpmanjr wrote: post #17

Can you create an option to find the most distant connection for a topic?

I think this is going to be extremely computationally intensive. One of the big performance wins I got when designing the search algorithm[1] was visiting as few nodes in the graph as possible (which I did via a bi-directional breadth-first search). To find the most distant node, I'd need to traverse the entire graph, which consists of almost 6 million nodes. It can be done, but it would take minutes, hours, days, ...

[1] https://github.com/jwngr/sdow/blob/a2699dc95d884ec64a4641630...

Post reply on HN