Work · alternatives · 2026
24 alternatives to L1-path-finder, a fast path planner for grids
L1-path-finder is a JavaScript library that finds shortest paths in grid-based mazes and environments. Users provide a binary ndarray representing a grid layout, and the tool builds a data structure that enables fast… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Prices are shown for the 1 we have checked on their own sites, 1 of them free or with a free tier. L1-path-finder, a fast path planner for grids launched in 2015; newer entries below may have overtaken it.
- 1NG
2020 · scleox.github.io · its alternatives →
- 2
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 →
- 3DS
2016 · christophercliff.com · its alternatives →
- 4
Running route planner for round-trips amongst greenery
2020 · trailrouter.com · its alternatives →
- 5
FastRouter.aifree tier, from $199/mo▲364Route requests to the right LLM for cost, latency & quality
22d ago · fastrouter.ai · its alternatives →
- 6
A simple, fast and user-friendly alternative to 'find' - sharkdp/fd
2017 · github.com · its alternatives →
- 7
- 8
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 →
- 9
HNSW implementation in Rust. Reference: https://arxiv.org/ftp/arxiv/papers/1603/1603.09320.pdf - swapneel/hnsw-rust
2024 · github.com · its alternatives →
- 10
JavaScript UI library for building great search experiences
2015 · community.algolia.com · its alternatives →
- 11
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 →
- 12
A path tracer written in Go. Contribute to fogleman/pt development by creating an account on GitHub.
2015 · github.com · its alternatives →
- 13
2020 · algoviz.njanjo.com · its alternatives →
- 14
Contribute to netb258/clj-maze development by creating an account on GitHub.
2019 · github.com · its alternatives →
- 15
We built a model router that plugs into coding agents (e.g. Claude Code, Codex, Cursor, etc.) and intelligently sends requests to the best model to serve them. Here's a quick demo of running it locally: https://www.youtube.com/watch?v=isKhAyivtfM. At Weave, we write most of our code with AI, and it's been getting more expensive. This came to a head when Opus 4.7 was released and, thanks to its tokenizer changes, our costs shot up. We knew we didn't need Opus for everything but we didn't want to lose out on the intelligence for the cases where you really need it. So we decided…
Jun 2026 · github.com · its alternatives →
- 16AN
2012 · petercottle.com · its alternatives →
- 17
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 →
- 18VA
2015 · mapzen.com · its alternatives →
- 19
⚡ The fastest directory crawler & globbing library for NodeJS. Crawls 1m files in < 1s - thecodrr/fdir
2020 · github.com · its alternatives →
- 20
- 21RA
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 →
- 22
:page_facing_up: A simple router for the browser in javascript - franciscop/pagex
2016 · github.com · its alternatives →
- 23
A discrete-time Python-based solver for the Stochastic On-Time Arrival routing problem - mehrdadn/SOTA-Py
2017 · github.com · its alternatives →
- 24
Powerful, award-winning Finder alternative.
2015 · cocoatech.com · its alternatives →
Also compare
- Non-grid-based path finder alternatives
- BFS, Dijkstra and A* interactive demo made in React alternatives
- Dijkstra’s algorithm in the web browser with OpenStreetMap alternatives
- Trail Router – generate running routes that prefer greenery and nature alternatives
- FastRouter.ai alternatives
- A simple, fast and user-friendly alternative to find, written in Rust alternatives
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 →