Package | Description |
---|---|
com.b3dgs.lionengine.game.map | |
com.b3dgs.lionengine.game.pathfinding | |
com.b3dgs.lionengine.game.strategy | |
demo.strategy |
Modifier and Type | Class and Description |
---|---|
class |
AbstractPathMap<TileType extends AbstractPathTile> |
Modifier and Type | Field and Description |
---|---|
protected PathBasedMap<? extends AbstractPathTile> |
AbstractPathMover.map |
Modifier and Type | Method and Description |
---|---|
float |
AStarHeuristic.getCost(PathBasedMap<? extends AbstractPathTile> map,
PathMover mover,
int x,
int y,
int tx,
int ty)
Get the additional heuristic cost of the given tile.
|
float |
ClosestHeuristic.getCost(PathBasedMap<? extends AbstractPathTile> map,
PathMover mover,
int x,
int y,
int tx,
int ty) |
float |
ClosestSquaredHeuristic.getCost(PathBasedMap<? extends AbstractPathTile> map,
PathMover mover,
int x,
int y,
int tx,
int ty) |
float |
ManhattanHeuristic.getCost(PathBasedMap<? extends AbstractPathTile> map,
PathMover mover,
int x,
int y,
int tx,
int ty) |
Constructor and Description |
---|
AbstractPathMover(PathBasedMap<? extends AbstractPathTile> map) |
AStarPathFinder(PathBasedMap<? extends AbstractPathTile> map,
int maxSearchDistance,
boolean allowDiagMovement)
Create a path finder with the default heuristic - closest to target.
|
AStarPathFinder(PathBasedMap<? extends AbstractPathTile> map,
int maxSearchDistance,
boolean allowDiagMovement,
AStarHeuristic heuristic)
Create a path finder.
|
Modifier and Type | Field and Description |
---|---|
protected PathBasedMap<?> |
Entry.map |
Constructor and Description |
---|
Building(PathBasedMap<?> map) |
Entry(PathBasedMap<?> map) |
Unit(PathBasedMap<?> map) |
Modifier and Type | Class and Description |
---|---|
class |
Map |