Decompose a 2D rectangular area into convex regions around obstacles (vias, rectangles, and arbitrary polygons). Useful for PCB autorouting and spatial partitioning where convex sub-regions simplify pathfinding.
A phaser3 pathfinding algorithm using heap data structure
SDK for Find & Order map
A visualization library experiment for interactive website effects based on pathfinding algorithms
fast-astar is an implementation of a* algorithm using javascript. Small and fast.
Pathfinding library
excalibur-pathfinding provides ability to use A* and Dijkstra's Algorithm for pathfinding and with Excalibur.js
Asynchronous A* Pathfinding API
The Ivy Pathfinding Algorithm Wrapped Accessible via Javascript
Minecraft pathfinder made in javascript using mineflayer and node js.
   
Contraction Hierarchy
DeepSeek adapter for Zhivex AI SDK.
Dijkstra calculator for the shortest path in a graph of nodes given a weight.
A 3D pathfinding library for Three.js， supporting navigation meshes (navmeshes) and various pathfinding algorithms.
3D Voronoi tessellation in Rust: a fast, feature-rich grid-based approach ready for WASM and TypeScript.
Comprehensive pathfinding library for grid based games
Creates and generates a 2 dimensional array with various path generation functions.
Data-oriented RPG game engine built with TypeScript and Pixi.js
A pathfinding library for typescript. Uses a modified A* algorithm to find the shortest path between two points over a tiled map.
fork from pathfinding
NavMesh + path-finding + obstáculos dinâmicos em JS/WASM
A Svelte package for visualizing graph pathfinding algorithms with interactive maze generation and solving.
A React component for visualizing A* pathfinding algorithm