TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Show HN: Website that finds least amount of clicks between two Wikipedia pages

6 pointsby jehna1almost 5 years ago

2 comments

jehna1almost 5 years ago
Hey HN<p>This is my hobby project I&#x27;ve been working on. At the moment there are 15231991 pages in English wikipedia, and a whopping 671872114 links between them.<p>This project uses custom-built Rust parser to parse through the data (in 15 minutes!) and Google BigQuery to find the shortest path between two pages using a rather simple breadth-first search query.<p>Let me know what you think!
Biqh1almost 5 years ago
We used to play this game in school. Everybody clicks random article at the same time then races to traverse links to a decided destination page.