How it works

Every blue link on Wikipedia is an edge in one enormous directed graph. I built that graph once before; this time it is a live service. A small Rust backend parses a full Wikipedia dump into a compact adjacency index plus a PageRank score per article, then serves it from a memory-mapped file, so lookups, link expansions, and shortest-path queries all answer in milliseconds.

The canvas keeps only what you have explored: each expansion merges a handful of neighbours into a small client-side graph laid out by d3-force. Node size tracks how heavily an article is linked, and arrows point the way the links actually go. Shortest paths run server-side as a bidirectional BFS over the full graph, the classic “getting to Philosophy” game solved exactly, and whatever path comes back is stitched into your canvas and highlighted.