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
Default constructor.
Public Static Methods
Construct a path with a start and end point.
Public Variables
Calculate partial path if the target node cannot be reached.
End node of the path.
End point of the path.
End Point exactly as in the path request.
Start Point exactly as in the path request.
Start point in integer coordinates.
Start node of the path.
Start point of the path.
Inherited Public Members
Blocks until this path has been calculated and returned.
Callback to call when the path is complete.
Claim this path (pooling).
Current state of the path.
Which graph tags are traversable.
If the path failed, this is true.
Aborts the path because of an error.
Additional info on why a path failed.
Total Length of the path.
Determines which heuristic to use.
Scale of the heuristic values.
Immediate callback to call when the path is complete.
Returns if this path is done calculating.
Constraint for how to search for nodes.
Holds the path as a Node array.
Releases a path claim (pooling).
Penalties for each tag.
Provides additional traversal information to a path request.
Holds the (possibly post processed) path as a Vector3 list.
Waits until this path has been calculated and returned.
Private/Protected Members
Estimated cost from the specified node to the target.
Calculates the path until completed or until the time has passed targetTick.
Returns if the node can be traversed.
Always called after the path has been calculated.
Checks if the start node is the target and complete the path if that is the case.
Completes the path using the specified target node.
The node currently being processed.
Returns a debug string for this path.
Writes text shared for all overrides of DebugString to the string builder.
Writes text shared for all overrides of DebugString to the string builder.
How long it took to calculate this path in milliseconds.
Saved original costs for the end node.
Applies a special case for grid nodes.
True for paths that want to search all nodes and not jump over nodes as optimizations.
May be called by graph nodes to get a special cost for some connections.
Returns penalty for the given tag.
Used in EndPointGridGraphSpecialCase.
True if the Reset function has been called.
Determines if a search for an end node should be done.
Target to use for H score calculations.
Target to use for H score calculation.
Initializes the path.
The tag penalties that are actually used.
Tag penalties set by other scripts.
Internal linked list implementation.
Called when the path enters the pool.
Current best target for the partial path.
Data for the thread calculating this path.
ID of this path.
Returns the state of the path in the pathfinding pipeline.
Prepares the path.
Prepares low level path variables for calculation.
Reset all values to their default values.
Calls callback to return the calculated path.
Number of nodes this path has searched.
Helper method to set PathNode.flag1 to a specific value for all nodes adjacent to a grid node.
Traces the calculated path from the end node to the start.
Sets the start and end points.