Class AStar<T>

See: https://en.wikipedia.org/wiki/A*_search_algorithm

It works for a 4 or 8 topology. The heuristic used is the Manhattan distance and the octile distance respectively.

const path = new AStar(
    [
        [0, 0, 0, 0, 1, 0],
        [0, 1, 1, 1, 1, 0],
        [0, 0, 0, 0, 0, 0],
        [0, 1, 0, 1, 1, 0]
    ],
    { type: 4 },
    (c) => c === 1
);

path.init();

const result = path.search({ x: 0, y: 2 }, { x: 0, y: 5 });

console.log(result);

{
  status: 'Success',
  positions: [
    { x: 0, y: 2 }, { x: 0, y: 1 },
    { x: 0, y: 0 }, { x: 1, y: 0 },
    { x: 2, y: 0 }, { x: 2, y: 1 },
    { x: 2, y: 2 }, { x: 2, y: 3 },
    { x: 2, y: 4 }, { x: 2, y: 5 },
    { x: 1, y: 5 }, { x: 0, y: 5 }
  ]
}