61–70 of 78 posts
Related: Six Degrees of Wikipedia - https://news.ycombinator.com/item?id=28595821 - Sept 2021 (67 comments) Six Degrees of Wikipedia - https://news.ycombinator.com/item?id=27444053 - June 2021 (1 comment) Show HN: Six Degrees of Wikipedia - https://news.ycombinator.com/item?id=16468196 - Feb 2018 (324 comments) Six Degrees of Wikipedia - https://news.ycombinator.com/item?id=201513 - May 2008 (7 comments)
Shameless plug, semi-related game I made some years ago based on Wikipedia links, where the goal is to find the page that’s _not_ linked to the others. https://havarnov.github.io/oddoneout/
Geronimus Polynomials -> Aenictus Raptor
You need to pick something that is only linked to in its "parent" article. So for example Aenictus Raptor is only really linked to on the Aenictus (genus) page, which is almost only linked to by the Ants page.
Don't do anything related to countries, because almost every article lists a country. So it's easy to traverse between them.
Interesting. I wonder what are the two most separated pages, i.e. pages with the longest path connecting them.
You go here: https://en.wikipedia.org/wiki/Wikipedia:Database_download Then you analyse the data and draw your own conclusions. If I had to guess there will be a lot of them but there will be roughly six or so (give or take 10) links on average from one article to another. Even the notion of longest path will be debatable - I know this because people are ... people. I've run a mediawiki based intranet for quite a whi…
The only debate would be between the diameter (longest shortest path, which is likely meant here) or the longest path (general version of the travelling salesman problem). The latter might be a bit slow on the entire Wikipedia dataset.
It seems buggy to me. I tried Kodiak bear and Gdańsk ( https://www.sixdegreesofwikipedia.com/?source=Kodiak%20bear&... ). The site found a 2-degree path through Europe article. But there is no link to Europe article form Kodiak bear article
This is an archetypical graph database query.
It is certainly an achetypical graph problem, shortest path, of which there are many ways to solve. Some algorithms are very highly efficient. I've tried some graph databases and was quite surprised at how hard they were to express using their query languages and how hard it was to solve them efficiently. I've had better luck with library based solutions.
Instead, one of us would press random to get the "target" article, and then all of us would press random on our own for a starting point.
Whoever got to the "target" first wins!