What Is Six Degrees of Wikipedia and How Does It Find the Shortest Link Path?

Six Degrees of Wikipedia is a small browser-based tool that finds the shortest chain of hyperlinks connecting any two Wikipedia pages. You give it a starting article and a target article, and it searches Wikipedia's internal link structure for the fewest clicks between them. The site is a JavaScript-dependent side project: with scripting disabled, the page only shows a notice that JavaScript is required, so the tool cannot run at all in that state.

The idea behind the name

The name borrows from "six degrees of separation," the familiar claim that any two people are connected through a short chain of acquaintances. Wikipedia is a natural place to test that idea because its articles are densely interlinked: most pages link to many others, and those links form a navigable graph.

The tool treats Wikipedia as exactly that — a graph where:

• each article is a node, and
• each internal hyperlink between articles is a directed edge.

Finding the shortest path then becomes a standard graph-search problem rather than a trivia game.

How the shortest path is found

The site's own description states its purpose plainly: find the shortest hyperlinked paths between any two pages on Wikipedia. The mechanism follows from that goal.

1. Input: you specify two Wikipedia pages — an origin and a destination.
2. Traversal: the tool follows links outward from the origin, level by level, checking which pages are reachable in one click, then two clicks, and so on.
3. Result: the first time the destination appears, that chain is the shortest one, because every shorter distance was already checked.

This level-by-level expansion is breadth-first search. Its key property is that it guarantees the minimum number of links, provided the search is allowed to run far enough. A depth-first approach — plunging down one chain before trying another — would find a path but not reliably the shortest.

A concrete example

Suppose you want to get from an article about a small town to an article about a distant scientific concept. A human browsing might wander through a dozen clicks. The tool instead checks all one-link neighbors of the town article, then all two-link pages, and so on, and reports the first chain that lands on the science article. The answer is often surprisingly short, which is the appeal of the "six degrees" framing.

Why JavaScript is required

The page evidence is explicit: the site is a "little side project" that "requires JavaScript." When scripting is off, visitors see only an apology-style message rather than any content or results.

That behavior tells you where the computation happens. The path search runs in your browser rather than being precomputed on a server, so the page needs script execution to fetch link data, run the traversal, and render the chain. Practical implications:

• Enable JavaScript for the site's domain before expecting any output.
• Expect no fallback: there is no static HTML version of the results.
• Browser extensions that block scripts (ad blockers, privacy tools, script managers) can silently break the tool; allowlisting the site usually resolves it.

What this tool is and is not

It is worth separating the project from Wikipedia itself:

If you are looking for Wikipedia's own navigation or search features, this tool is not that; it is a third-party lens on Wikipedia's link graph.

When it is useful

The tool fits exploratory and educational use: satisfying curiosity about how tightly connected the encyclopedia is, demonstrating graph-search concepts with a real dataset, or settling a friendly "how many clicks apart are these two articles?" question. It is not a research database, and it does not modify or mirror Wikipedia content — it only reports paths through existing links.

To use it, open the site with JavaScript enabled, enter your two pages, and read the returned chain. If nothing happens, check script blocking first; that is the single most common reason the tool appears broken.