nowfound

Life & fun · alternatives · 2026

24 alternatives to Pathfind

PathFind using Breadth-First Search

Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Pathfind launched in 2022; newer entries below may have overtaken it.

  1. 1

    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

    2021 · github.com · its alternatives →

  2. 2LP
  3. 3DS
  4. 4

    Decided to remake my old pathfinding project to hexagonal tiles. Pretty happy with how it turned out. Source code: https://github.com/honzaap/Pathfinding

    2022 · honzaap.github.io · its alternatives →

  5. 5AV
  6. 6

    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…

    2024 · github.com · its alternatives →

  7. 7

    Experimental C implementation of “Breaking the Sorting Barrier for Directed Single-Source Shortest Paths” by Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, and Longhui Yin (STOC 2025) - danalec/DMMSY-SSSP

    Feb 2026 · github.com · its alternatives →

  8. 8

    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.

    2016 · workshape.github.io · its alternatives →

  9. 9

    Pathfinding visualizer on a real map, anywhere in the world

    2024 · honzaap.github.io · its alternatives →

  10. 10NG

    2020 · scleox.github.io · its alternatives →

  11. 11RA

    I've been begrudgingly working on autorouters for 2 years, looking for new techniques or modern methods that might allow AI to create circuit boards. One of the biggest problems in my view for training an AI to do autorouting is the traditional grid-based representation of autorouting problems which challenges spatial understanding. But we know that vision models are very good at classifying, so I wondered if we could train a model to output a path as a classification. But then how do you represent the path? This lead me down the track of trying to build an autorouter that represented paths…

    Feb 2026 · pattern-pathfinder.vercel.app · its alternatives →

  12. 12

    Visualize pathfinding algorithms

    2024 · pathfinding.petersimone.xyz · its alternatives →

  13. 13

    HNSW implementation in Rust. Reference: https://arxiv.org/ftp/arxiv/papers/1603/1603.09320.pdf - swapneel/hnsw-rust

    2024 · github.com · its alternatives →

  14. 14

    Stephen Wolfram's new book on the Wolfram Language

    2015 · wolfram.com · its alternatives →

  15. 15

    A guide to functional programming

    2016 · amazon.com · its alternatives →

  16. 16

    An illustrated guide for programmers

    2016 · amazon.com · its alternatives →

  17. 17
  18. 18WJ
  19. 19

    ⚡ The fastest directory crawler & globbing library for NodeJS. Crawls 1m files in < 1s - thecodrr/fdir

    2020 · github.com · its alternatives →

  20. 20

    A simple re-implementation of Google's sparsehash as a learning excercise. - qpfiffer/Simple-Sparsehash

    2015 · github.com · its alternatives →

  21. 21

    👾 Rust WebAssembly A* Pathfinding Demo. Contribute to jacobdeichert/wasm-astar development by creating an account on GitHub.

    2017 · github.com · its alternatives →

  22. 22

    I want to share a really dumb, but very practical project I have packaged this summer, to perform operations on strings much faster. I was using Python to work with a multi-terabyte newline-delimited file. Reading, splitting, and shuffling it was a nightmare. So, I wrapped a trivial hardware-friendly heuristic I've been using for the last few years into a CPython library. The part I enjoyed the most is implementing SIMD behavior without SIMD instructions... Using 64-bit words to work at 8-bit granularity. Unlike conventional SIMD, the code would remain the same for ~~almost~~ any hardware.…

    2023 · ashvardanian.com · its alternatives →

  23. 23

    Visualize, learn and explore algorithms

    2024 · algorithmvisualizersuite.blogspot.com · its alternatives →

  24. 24WM

Also compare

Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →