1 مستودع
Selecting from multiple pathfinding strategies including A*, Dijkstra, Breadth-First, and Jump Point Search.
Distinct from Algorithm and Hyperparameter Selection: Distinct from Algorithm and Hyperparameter Selection: focuses on selecting pathfinding algorithms for grid navigation, not machine learning model selection.
Explore 1 awesome GitHub repository matching artificial intelligence & ml · Pathfinding Algorithm Selection. Refine with filters or upvote what's useful.
PathFinding.js is a grid-based pathfinding library that implements multiple search algorithms for computing optimal routes on 2D maps. It provides implementations of A*, Dijkstra, Breadth-First Search, and Jump Point Search, each designed to find the shortest path between two points on a grid while avoiding obstacles. The library is built around a pluggable architecture where each pathfinding strategy shares a common interface, allowing algorithms to be selected at runtime without modifying core logic. It includes a configurable diagonal movement rule engine that controls diagonal traversal b
Allows selection from multiple pathfinding strategies including A*, Dijkstra, Breadth-First, and Jump Point Search.