nowfound

Life & fun · January 17, 2021

BFS, Dijkstra and A* interactive demo made in React

Visual explanation of pathfinding algorithms and how a*, Dijkstra and BFS can be seen as the same algorithm with different parameter/data structures used under the hood - npretto/pathfinding

BFS, Dijkstra and A* interactive demo made in React launched on January 17, 2021 with 94 votes, #395 of 3,157 launches that month and more than 90% of that year's launches. The site was still online in September 2026, 5 years on.

Visit github.com ↗Alternativestop 13% of January 2021

In plain words

BFS, Dijkstra and A* is an interactive demonstration of three pathfinding algorithms built with React. It visualizes how breadth-first search, Dijkstra's algorithm, and A* explore and solve pathfinding problems in real time. The tool is designed for students and developers learning computer science concepts, particularly those studying graph traversal and optimization techniques. Users can watch each algorithm's approach to finding optimal paths and understand the differences in how they navigate problem spaces.

written from the facts on this page · September 2026

Does a similar job

all alternatives →
  • DS
    Dijkstra’s algorithm in the web browser with OpenStreetMap2016 · christophercliff.com · ▲158
  • Wave function collapse algorithm2016 · github.com · ▲1,226

    Bitmap & tilemap generation from a single example with the help of ideas from quantum mechanics - mxgmn/WaveFunctionCollapse

  • Visual A* pathfinding and maze generation in Python2024 · github.com · ▲135

    I was fascinated reading through another recent HN submission about a highly efficient implementation of A* in Lisp, which got me thinking about how I could do something similar in Python. However, these kinds of pathfinding algorithms really need complex terrain/mazes with interesting obstructions to showcase what they can do and how they work. So, I started thinking about how I could generate cool and diverse random "mazes" (they aren't really mazes, but I'm not sure what the best term is). I got a bit carried away thinking of lots of different cool ways to generate these mazes, such…

  • A gallery of graphs built with React and D3.js2023 · react-graph-gallery.com · ▲297

    Many JS libraries exist to build graphs on the web (Vega, chartJS, Plotly...). They allow to make charts quickly. But you lose flexibility: you're limited by the options they offer. I just created a gallery with hundreds of graphs made with d3.js and React. - Examples are split by graph types - They all come with explanation and code sandboxes - Gradual complexity to ease the learning curve It took me ages to create this project! Feedback welcome!

  • A Visual Guide to Graph Traversal Algorithms2016 · workshape.github.io · ▲15

    Interactive visualisations help explain Depth First Search and Breadth First Search as well as algorithms based upon each approach. A very useful resource for learning by seeing.

  • Pathfind2022 · victorribeiro.com · ▲7

    PathFind using Breadth-First Search

Questions this answers

More life & fun this month

the category →

Source: Show HN post ↗

Launched alongside, January 2021

the whole month →