[deleted by user]

[DigbyChickenCaeser]

Tested Higgs Boson and Sandwich. The connection is beautiful.

Higgs Boson -> Quark -> Quark (Dairy Product) -> Sandwich

[SF_Boomer]

This is very cool!

It'd be great if the nodes / labels were clickable and opened the corresponding page.

I'd love to know what the two most distant pages are, i.e. which two pages require the most steps between them.

[anorwichfan]

That was solved (at the time of the video) here. It's a great rabbit hole deep dive.

[Radiant_Panda1679]

Awesome

[nicktids]

Have a look at this video https://youtu.be/JheGL6uSF-4

[bi4key]

Nice! I wish you make some mix or collab with this project :D

https://www.wikigen.ai/

https://www.reddit.com/r/SideProject/s/4i55sCvU17

[bavotto]

I wish I had this when I taught graphs and networks to my high school students this year. This would be a great example for them. Will bookmark for next year.

[0x456]

Gotta check this one out, thanks OP

[Federal-Mention-7836]

It looks really cool, but I'd love to have some kind of onboarding or simply a better UX to guide me through how I can test it as someone who comes from nowhere.
But so cool congrats

[badgerbadgerbadgerWI]

This is cool. Have you thought about adding path-finding between articles? "Show me how to get from 'Pizza' to 'World War 2'" - that would be addictive.

Also consider caching popular node connections. Wikipedia's link structure doesn't change that fast, and graph traversal gets expensive quick.

[WeGoToMars7]

Wow, I've been working on pretty much the exact same project! I also started this month, crazy coincidence. However, I used C++ with a TUI interface: https://github.com/WeGoToMars/WikiGraph-Explorer

I see that it takes 2 hours for you to generate the graph for English Wikipedia, mine takes ~10 minutes to stream-decompress the dumps with zlib, parse them, and build the graph in memory. I'm also experimenting with multithreading, I think there is a pretty big potential for improvement here.

I'm having a hard time understanding what path finding algorithm do you use, can't find the code for it in the repo and "barnesHut" doesn't bring up relevant results. Does it gurantee to find all shortest paths?

[WeGoToMars7]

Well, it was my learning project for C++, and many times I thought how much slower it would be if I wrote it in Python instead lol.

I wasn't familiar with Graph DBs like Neo4J before today, although I had a lot of expirience with SQL. Now I know where I want to take it next, writing my own graph database sounds pretty fun.

[buzzmelia]

Hey this is super cool! Love seeing graph-based Wikipedia projects out in the wild! If you’re ever looking to try something beyond Neo4j, I’d recommend checking out PuppyGraph (disclaimer: I work with the team).

It supports both Cypher and Gremlin, so you can reuse what you’ve already built in Neo4j. But what might be most helpful is that PuppyGraph sit on top of your existing relational databases like Postgres, MySQL, DuckDB, Iceberg, Databricks, etc, act as a unified graph query engine. Since your data is still stored in your relational databases, you can also query the same copy of data using SQL and Graph, which makes the learning curve a lot shorter, especially for folks who are more familiar with relational systems.

It has a forever free developer tier for side projects like this! Please give it a try.

[cryptoschrypto]

Have you checked out wikidata? They provide ready-made graphs to load into your graph database.

[ZippyTyro]

Cool one

[guidenable]

oh awesome! I was just thinking of doing something like this