AIPathGridSolver
[
Front page
] [
New
|
Page list
|
Search
|
Recent changes
|
Help
|
Log in
]
Start:
* Class: AIPathGridSolver
Implements the A* algorithm to find the shortest path bet...
** Constructors
- ''new AIPathGridSolver''(): AIPathGridSolver~
** Methods
- ''heuristic''(grid: AIPathGrid, a: T, b: T)~
Returns an array of more closest to least close direction...
-- ''grid'': The grid.~
-- ''a'': The starting position in the grid.~
-- ''b'': The destination position in the grid.~
~
- ''solve''(grid: AIPathGrid, startCoord: T, endCoord: T)~
Find the shortest path between a start node and an end no...
-- ''grid'': A grid representing the pathfinding area. It...
-- ''startCoord'': The starting position in the grid.~
-- ''endCoord'': The destination position in the grid.~
End:
* Class: AIPathGridSolver
Implements the A* algorithm to find the shortest path bet...
** Constructors
- ''new AIPathGridSolver''(): AIPathGridSolver~
** Methods
- ''heuristic''(grid: AIPathGrid, a: T, b: T)~
Returns an array of more closest to least close direction...
-- ''grid'': The grid.~
-- ''a'': The starting position in the grid.~
-- ''b'': The destination position in the grid.~
~
- ''solve''(grid: AIPathGrid, startCoord: T, endCoord: T)~
Find the shortest path between a start node and an end no...
-- ''grid'': A grid representing the pathfinding area. It...
-- ''startCoord'': The starting position in the grid.~
-- ''endCoord'': The destination position in the grid.~
Page: