@serbanghita-gamedev/pathfinding v0.1.0

Pathfinding

Pathfinding library that implements A* with Euclidean distance.
On success it can return the full backtracked path or only the waypoints.

This library provides you with:

• path finding for a map represented by a matrix (1D / flat or 2D).
• path found as int[] that can be the full path array of tiles or only the waypoints tiles (where the direction changes).
• logic can run in a loop (step by step, e.g. only 30 times per second) or continuous (e.g. Webworker)
• hooks like onInsertQueue(node) on onSuccess.

Result type	Demo
FULL_PATH_ARRAY
WAYPOINT_PATH_ARRAY

Install

npm install @serbanghita-gamedev/pathfinding

Example

const aStar = new AStarPathFinding({
  matrix2D: [
    [0, 1, 0, 0, 0],
    [0, 1, 0, 1, 0],
    [0, 0, 0, 1, 0],
  ],
  matrixTileSize: 1,
  searchType: AStarPathFindingSearchType.BY_STEP,
  startCoordinates: { x: 0, y: 0 },
  finishCoordinates: { x: 4, y: 2 },
});
// include the following in your loop() fn.
let result = aStar.search();

Config

You can use the library in two modes:

• BY_STEP - recommended for loops, batches (e.g. game loop). This is when you're executing aStar.search() on each tick.
• CONTINUOUS - Recommended for separate thread (e.g. WebWorker). This is for when you're executing aStar.search() in one blocking operation.

Contributing

• Always include tests
• Make sure you run vitest --watch=false --coverage
• Lint the code with eslint ./src
• Open a PR, assign @serbanghita as reviewer

Credits

• Serban Ghita