The path of the AyStar algorithm. More...
Public Member Functions | |
constructor AyStar | Path (old_path, new_tile, new_direction, cost_callback, pf_instance) |
function | GetTile () |
Return the tile where this (partial-)path ends. | |
function | GetDirection () |
Return the direction from which we entered the tile in this (partial-)path. | |
function | GetParent () |
Return an instance of this class leading to the previous node. | |
function | GetCost () |
Return the cost of this (partial-)path from the beginning up to this node. | |
function | GetLength () |
Return the length (in tiles) of this path. |
Public Attributes | |
_prev = null | |
_tile = null | |
_direction = null | |
_cost = null | |
_length = null |
The path of the AyStar algorithm.
It is reversed, that is, the first entry is more close to the goal-nodes than his GetParent(). You can walk this list to find the whole path. The last entry has a GetParent() of null.