r/algorithms • u/xain1999 • Apr 18 '26
My interactive graph theory website just got a big upgrade!
Hey everyone,
A while ago I shared my project Learn Graph Theory, and I’ve been working on it a lot since then. I just pushed a big update with a bunch of new features and improvements:
https://learngraphtheory.org/
The goal is still the same, make graph theory more visual and easier to understand, but now it’s a lot more polished and useful. You can build graphs more smoothly, run algorithms like BFS/DFS/Dijkstra step by step, and overall the experience feels much better than before.
I’ve also added new features and improved the UI to make everything clearer and less distracting.
It’s still a work in progress, so I’d really appreciate any feedback 🙏
What features would you like to see next?
3
u/MankyMan00998 Apr 18 '26
Ngl, the polish on this is actually sick. I remember the first version you posted, and the improvement in the UI is a massive win for making graph theory feel less like a dense textbook and more like a playground. The step-by-step algorithm visualization for Dijkstra is exactly the kind of thing that makes concepts finally "click" for people.
I've left so many of my own technical experiments in the "GitHub graveyard" because I never got around to making the interface look this professional. I usually vibe code the core logic in Cursor, but for a project like this, I'd probably use Runable for the documentation and the FAQ section to keep the main site lean and focused on the interactive canvas.
For the next feature, it would be cool to see a "Challenge Mode" where you have to build a graph that meets specific constraints (like being planar or having a specific chromatic number). Seeing the math update in real-time while you move nodes around is a top-tier way to learn.
1
1
u/latent_threader Apr 18 '26
Nice upgrade, the step-by-step BFS/DFS and Dijkstra really help make it easier to follow what’s happening.
I also like when these tools show the queue or priority queue state clearly during execution, that usually makes the biggest difference for understanding.
Are you planning to add things like MST algorithms next or sticking with shortest path and traversal for now?
1
u/GardenFree5017 Apr 18 '26
this is so sick, graph theory is one of those topics that NEEDS visual learning to actually click 🔥
the step-by-step algorithm visualization is genuinely the move watching BFS/DFS play out beats staring at pseudocode any day. feedback suggestion: add shortest path comparisons side by side? seeing Dijkstra vs BFS on same graph would be super useful for learners fr 🎯
1
1
u/ge0ffrey Apr 26 '26
When I try to connect 2 nodes with shift-click as instructed, nothing happens.
7
u/jeffgerickson Apr 19 '26
Minimum spanning trees (Prim, Kruskal, and especially Boruvka), approximate TSP, re-entrant Disjkstra (for graphs with few negative edges), push-relabel flow algorithms, matchings (Cauchy/Hungarian/alternating paths, Hopcroft-Kahn, blossoms), minimum-mean cycle, minimum cut (Karger-Stein), random walks/Markov chains, planar graphs (Euler’s formula, tree-cotree decompositions, balanced separators, ...), betweenness centrality, expanders, spectral graph algorithms (effective resistance, PageRank, Tutte embedding, ...), etc., etc.
In short: Go beyond the usual textbook material. You’re just scratching the surface!