Class ABPath Extends Path
Basic path, finds the shortest path from A to B.
This is the most basic path object it will try to find the shortest path between two points.
Many other path types inherit from this type.
Public Methods
Public Static Methods
Public Variables
Calculate partial path if the target node cannot be reached.
Total cost of this path as used by the pathfinding algorithm.
End node of the path.
End point of the path.
True if this path type has a well defined end point, even before calculation starts.
Optional ending condition for the path.
End Point exactly as in the path request.
Start Point exactly as in the path request.
Start node of the path.
Start point of the path.
Inherited Public Members
Current state of the path.
Returns the state of the path in the pathfinding pipeline.
Callback to call when the path is complete.
How long it took to calculate this path in milliseconds.
If the path failed, this is true.
Additional info on why a path failed.
Determines which heuristic to use.
Scale of the heuristic values.
Immediate callback to call when the path is complete.
Constraint for how to search for nodes that are traversable by this path.
Distance metric to use when searching for the start and end nodes in the graph.
ID of this path.
Number of nodes this path has searched.
Constrains which nodes the path can traverse.
Specifies the cost of traversing different nodes.
Holds the (possibly post-processed) path as a Vector3 list.
Private/Protected Members
Helper method to add endpoints around a specific unwalkable grid node.
Calculates the path until completed or until the time has passed targetTick.
Writes text shared for all overrides of DebugString to the string builder.
Writes text shared for all overrides of DebugString to the string builder.
Applies a special case for grid nodes.
Called when a valid node has been found for the end of the path.
True if the Reset function has been called.
Determines if a search for an end node should be done.
Current best target for the partial path.