Namespace Pathfinding
Namespaces
Local avoidance related classes.
Synchronization primitives.
Classes
Applies penalty to the paths it processes telling other units to avoid choosing the same path.
Convenience class to access the default implementation of the ITraversalProvider.
Represents a collection of settings used to update nodes in a specific region of a graph.
A path which searches from one point to a number of different targets in one search or from a number of different start points to a single target.
A special NNConstraint which can use different logic for the start node and end node in a path.
Public Methods
Public Enums
What to do when the character is close to the destination.
How to visualize the graphs in the editor.
Info about if a graph update has been applied or not.
How to estimate the cost of moving to the destination during pathfinding.
Number of neighbours for a single grid node.
Determines which direction the agent moves in.
State of a path request.
How path results are logged by the system.
Internal state of a path in the pipeline.
Info about where in the scanning process a graph is.
Indicates the side of a line that a point lies on.
Number of threads to use.