@bedard/pathfinder
Advanced tools
@bedard/pathfinder
This project is a simple javascript implementation of the A* search algorithm. It was mainly built to get my feet wet with Solid.js.
Use findPath to find the shortest path between two points within a two-dimensional matrix.
import { findPath } from '@bedard/pathfinder'
const maze = [
[0, 0, 0, 0, 0],
[1, 1, 1, 1, 0],
[0, 0, 0, 0, 0],
[0, 1, 1, 1, 1],
[0, 0, 0, 0, 0],
]
const solution = findPath({
data: maze,
from: { row: 0, col: 0 },
to: { row: 4, col: 4 },
})
console.log(solution) // [{ row, col }, ...]
To optimize the solution, an optional heuristic function can be used. Included with this library are euclidean and manhattan distance helpers. When no heuristic function is defined, it will use Dijkstra's algorithm.
import { euclidean, findPath } from '@bedard/pathfinder'
findPath({
data,
from,
to,
heuristic: euclidean,
})
Copyright (c) 2024-present, Scott Bedard
FAQs
A* path finding algorithm
We found that @bedard/pathfinder demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Research
Four npm packages disguised as cryptographic tools steal developer credentials and send them to attacker-controlled Telegram infrastructure.
Security News
Ruby maintainers from Bundler and rbenv teams are building rv to bring Python uv's speed and unified tooling approach to Ruby development.
Security News
Following last week’s supply chain attack, Nx published findings on the GitHub Actions exploit and moved npm publishing to Trusted Publishers.