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.
Utility class that provides methods for working with Iterables.
Contract for min-heap implementations used in pathfinding algorithms.
Represents a node in the pathfinding graph.
Deprecated.
Pathetic's future focus will rely heavily on finding paths, not modifying or
post-processing them.
A highly optimized, array-backed binary min-heap for A* pathfinding.
A quaternary (4-ary) min-heap implementation optimized for pathfinding algorithms.
Utility class to pack 3D grid coordinates (Region Indices or Block Positions) into a single
primitive long.
Contract for data structures that can dynamically resize their internal storage.
Contract for heap implementations that use sift operations to maintain heap property.
The SpatialData class represents the data associated with a grid region.