simple a* implementation for non diagonal pathfinding between equidistant points, used by road and mapGrid pathfinding
|
|
override void | Calculate (int maxCalculations=PathQuery.DEFAULT_MAX_CALCULATIONS) |
| |
|
override void | Add (Vector2Int point) |
| |
|
override void | Remove (Vector2Int point) |
| |
|
override void | Clear () |
| |
|
override void | AddLink (IGridLink link) |
| |
|
override void | RemoveLink (IGridLink link) |
| |
|
override void | AddSwitch (Vector2Int point, GridPathfindingBase other) |
| |
|
override void | AddSwitch (Vector2Int entry, Vector2Int point, Vector2Int exit, GridPathfindingBase other) |
| |
|
override void | BlockTags (IEnumerable< Vector2Int > points, IEnumerable< object > tags) |
| |
|
override void | UnblockTags (IEnumerable< Vector2Int > points, IEnumerable< object > tags) |
| |
|
override IEnumerable< Vector2Int > | GetPoints () |
| |
| override bool | HasPoint (Vector2Int point, object tag=null) |
| | checks if a point exists within the pathfinder
for example points on map pathing that are blocked or points for road pathing that dont have a road
|
| |
| override WalkingPath | FindPath (Vector2Int[] starts, Vector2Int[] targets, object tag=null) |
| | attempts to find a path between one of the starts and one of the ends
|
| |
| override PathQuery | FindPathQuery (Vector2Int[] starts, Vector2Int[] targets, object tag=null) |
| |
|
override void | Dispose () |
| |
|
void | Calculate (int maxCalculations=PathQuery.DEFAULT_MAX_CALCULATIONS) |
| |
|
virtual void | Add (IEnumerable< Vector2Int > points) |
| |
|
void | Add (Vector2Int point) |
| |
|
virtual void | Remove (IEnumerable< Vector2Int > points) |
| |
|
void | Remove (Vector2Int point) |
| |
|
void | Clear () |
| |
|
void | AddLink (IGridLink link) |
| |
|
void | RemoveLink (IGridLink link) |
| |
|
void | AddSwitch (Vector2Int point, GridPathfindingBase pathfinding) |
| |
|
void | AddSwitch (Vector2Int entry, Vector2Int point, Vector2Int exit, GridPathfindingBase pathfinding) |
| |
|
void | BlockTags (IEnumerable< Vector2Int > points, IEnumerable< object > tags) |
| |
|
void | UnblockTags (IEnumerable< Vector2Int > points, IEnumerable< object > tags) |
| |
|
IEnumerable< Vector2Int > | GetPoints () |
| |
| bool | HasPoint (Vector2Int point, object tag=null) |
| | checks if a point exists within the pathfinder
for example points on map pathing that are blocked or points for road pathing that dont have a road
|
| |
| WalkingPath | FindPath (Vector2Int[] starts, Vector2Int[] targets, object tag=null) |
| | attempts to find a path between one of the starts and one of the ends
|
| |
| PathQuery | FindPathQuery (Vector2Int[] starts, Vector2Int[] targets, object tag=null) |
| |
|
void | Dispose () |
| |