Class AStar

Hierarchy

AStar

Index

Constructors

Methods

findPathInGrid getNeighbors heuristic isValid reconstructPath

Constructors

constructor

new AStar(): AStar
Returns AStar

Methods

`Static` findPathInGrid

findPathInGrid(grid, start, goal, allowDiagonal?): null | Point[]
Finds the shortest path in a 2D grid using A* algorithm
Parameters
- grid: number[][]
  
  2D array where 0 is walkable and 1 is obstacle
- start: Point
  
  starting point
- goal: Point
  
  goal point
- allowDiagonal: boolean = false
  
  whether diagonal movement is allowed
Returns null | Point[]
array of points representing the path, or null if no path exists
- Defined in algorithms/AStar.ts:45

`Static` `Private` getNeighbors

getNeighbors(grid, point, allowDiagonal): Point[]
Gets valid neighbors of a point in the grid
Parameters
- grid: number[][]
- point: Point
- allowDiagonal: boolean
Returns Point[]
- Defined in algorithms/AStar.ts:159

`Static` `Private` heuristic

heuristic(a, b): number
Heuristic function (Manhattan distance)
Parameters
- a: Point
- b: Point
Returns number
- Defined in algorithms/AStar.ts:137

`Static` `Private` isValid

isValid(grid, point): boolean
Checks if a point is valid in the grid
Parameters
- grid: number[][]
- point: Point
Returns boolean
- Defined in algorithms/AStar.ts:184

`Static` `Private` reconstructPath

reconstructPath(node): Point[]
Reconstructs the path from start to goal
Parameters
- node: Node
Returns Point[]
- Defined in algorithms/AStar.ts:144

Generated using TypeDoc