A generic type representing the data associated with the graph nodes. It must extend the Point interface.
Optional algorithmThe pathfinding algorithm to be used for finding the shortest path.
The available options are defined in the PathfindingAlgorithm enum. If not specified, the default algorithm is A*.
Optional heuristicThe heuristic function used to estimate the cost from a node to the goal. It guides the pathfinding algorithm to explore the most promising paths first, leading to faster and more efficient pathfinding. Optional if using the Theta* algorithm.
Generated using TypeDoc
Represents options for the pathfinding algorithm.