#include <Pathfinder.h>
|
static bool | aStar (std::vector< Tile * > &constructedPath, Tile *start, Tile *goal) |
|
static double | heuristic (Tile *pTile, Tile *next) |
|
static double | crossover (Tile *pTile, Tile *start, Tile *goal) |
|
static Tile * | find_closest_walkable_tile (Tile *start, Tile *destination, int range) |
|
static Tile * | find_first_walkable_tile (Tile *start) |
|
static Tile * | find_first_harvestable_tile (Tile *pTile) |
|
static std::vector< Tile * > | reconstruct_path (Tile *start, Tile *goal, std::unordered_map< Tile *, Tile * > &came_from) |
|
static Tile * | find_first_attackable_tile (Tile *start) |
|
◆ aStar()
bool Pathfinder::aStar |
( |
std::vector< Tile * > & |
constructedPath, |
|
|
Tile * |
start, |
|
|
Tile * |
goal |
|
) |
| |
|
static |
◆ crossover()
double Pathfinder::crossover |
( |
Tile * |
pTile, |
|
|
Tile * |
start, |
|
|
Tile * |
goal |
|
) |
| |
|
static |
◆ find_closest_walkable_tile()
Tile * Pathfinder::find_closest_walkable_tile |
( |
Tile * |
start, |
|
|
Tile * |
destination, |
|
|
int |
range |
|
) |
| |
|
static |
◆ find_first_attackable_tile()
Tile * Pathfinder::find_first_attackable_tile |
( |
Tile * |
start | ) |
|
|
static |
This is a breadth-first search which looks for a walkable tile
◆ find_first_harvestable_tile()
Tile * Pathfinder::find_first_harvestable_tile |
( |
Tile * |
pTile | ) |
|
|
static |
This is a breadth-first search which looks for a walkable tile
◆ find_first_walkable_tile()
Tile * Pathfinder::find_first_walkable_tile |
( |
Tile * |
start | ) |
|
|
static |
This is a breadth-first search which looks for a walkable tile
◆ heuristic()
double Pathfinder::heuristic |
( |
Tile * |
pTile, |
|
|
Tile * |
next |
|
) |
| |
|
static |
◆ reconstruct_path()
std::vector< Tile * > Pathfinder::reconstruct_path |
( |
Tile * |
start, |
|
|
Tile * |
goal, |
|
|
std::unordered_map< Tile *, Tile * > & |
came_from |
|
) |
| |
|
static |
The documentation for this class was generated from the following files: