All Classes and Interfaces

Class
Description
Provides a skeletal implementation of the Pathfinder interface, defining common behavior for pathfinding algorithms.
An A* pathfinding algorithm that uses a heuristic to guide the search toward the target.
 
 
Represents a cost value used in pathfinding.
Represents the depth of a pathfinding node or element.
Computes a distance metric for the current state of a pathfinding operation.
A marker interface to implement, to provide environment-specific information to the Pathfinder.
 
Marks an API as experimental.
A ConcurrentHashMap that removes entries on access if they are expired.
A wrapper for values stored in the ExpiringHashMap that includes an expiration time.
The GridRegionData class represents the data associated with a grid region.
 
 
Represents a set of weights used to calculate a heuristic for the A* pathfinding algorithm.
Defines the contract for heuristic strategies used in pathfinding algorithms.
 
Utility class that provides methods for working with Iterables.
A linear heuristic strategy combining multiple distance metrics for pathfinding.
Represents information about a position in the pathfinding environment.
The NavigationPointProvider interface defines methods for retrieving navigation point data at specific positions within a 3D environment.
 
Represents a node in the pathfinding graph.
A processor that calculates a specific cost contribution for traversing to a node (PathPosition).
Provides context for the evaluation of a single node (PathPosition) during a pathfinding search.
 
A processor that validates whether a node (PathPosition) or the transition to it is permissible during pathfinding.
Utility class for common number operations.
A functional interface representing a supplier that accepts a parameter and returns a result.
A Path is a sequence of positions that represents a path through a 3D space.
 
A Pathfinder is a class that can find a path between two positions while following a given set of rules.
Defines a set of configurable parameters that govern the behavior of the A* pathfinding algorithm.
 
A factory interface for creating Pathfinder instances.
Interface for hooks that are called during the pathfinding process.
An interface for initializing Pathfinder instances.
The result of a pathfinding operation.
 
Context for the current step of the pathfinding process.
Immutable container for the three core positions in a pathfinding operation.
 
Represents a position.
The state of a finished pathfinding process.
Utility class providing post-processing operations on Path objects.
Represents a 3D vector within a pathfinding context.
Base interface for pathfinding processors.
Provides context for an entire pathfinding search operation.
 
A performance-optimized heuristic strategy using squared distance metrics.
 
Utility class for creating and combining NodeValidationProcessor instances.