Creator here. Six Degrees of Wikipedia is a side project I've been sporadically hacking on over the past few years. It was an interesting technical challenge and it's fun to play with the end result. Here's the tech stack: * Frontend: React (Create React App) * Backend: Python Flask * Database: SQLite * Web (frontend) hosting: Firebase Hosting * Server (backend) hosting: Google Compute Engine (it runs fine on a tiny…
Damn, you beat me to it! I've been hacking on something similar for the longest time. Thanks for sharing your code!
Show HN: Six Degrees of Wikipedia
101–110 of 354 posts
Re: Show HN: Six Degrees of Wikipedia
#102(The code may need some tweaks to work with the latest Neo4j version.)
Re: Show HN: Six Degrees of Wikipedia
#103Re: Show HN: Six Degrees of Wikipedia
#104Could you make it possible to just test with the fun suggestions that scroll through?
Re: Show HN: Six Degrees of Wikipedia
#105Re: Show HN: Six Degrees of Wikipedia
#106Not sure if you deliberately designed it this way, but I noticed when spot checking some results that it includes the bibliography section links as connections. This seems like it may not be desirable. Example, I did a search that went from the Crusades to Buzz Aldrin and I noticed that Routledge was the first hop from the Crusades. It strikes me as odd that Routledge (a publishing company) would be mentioned on the…
Yeah unfortunately I don't know of any way to differentiate the different types of links. Wikipedia's pagelinks database doesn't different them. I agree it's undesireable but I just cannot figure out how to cull them.
Re: Show HN: Six Degrees of Wikipedia
#107Does anyone know what the "diameter" of the wikipedia graph is? In other words, what is the longest shortest path between two wikipedia articles?
Well that question only makes sense for connected graphs, we don't really know whether this is connected. So in general a version of this question that makes sense is, among all the connected components of the wikipedia graph, what is the largest diameter.
And yes, the graph is not connected (there are both nodes with no outgoing links and with no incoming links), but over 99% of the pages are connected, so the answer would still be interesting and worthwhile.
Re: Show HN: Six Degrees of Wikipedia
#108Creator here. Six Degrees of Wikipedia is a side project I've been sporadically hacking on over the past few years. It was an interesting technical challenge and it's fun to play with the end result. Here's the tech stack: * Frontend: React (Create React App) * Backend: Python Flask * Database: SQLite * Web (frontend) hosting: Firebase Hosting * Server (backend) hosting: Google Compute Engine (it runs fine on a tiny…
Do you simply do a BFS to find the shortest paths? If so, are you doing any tricks to avoid the path explosion problem?
Re: Show HN: Six Degrees of Wikipedia
#109Re: Show HN: Six Degrees of Wikipedia
#110This looks great! Nice work. I have a suggestion: Could you highlight a path when an edge is clicked on? I guess the clicking on the nodes can link to their wiki pages.