|
Path Finder (2D/3D) 1.0.1
Create and use simple navigation graphs for 2D/3D path finding with choice of 4 search algorithms.
|

Public Member Functions | |
| AshCrowFlight () | |
| AshCrowFlight (double factor) | |
| double | getCost (GraphNode node, GraphNode target) |
| double | getCost (GraphNode node, GraphNode target) |
This class is used to calculate the heuristic estimated-cost-to-goal.
It estimates the cost to goal as the Euclidean (as the crow flies) distance between the current node and the goal.
It is also possible to apply a scaling factor to the heuristic.
| pathfinder.AshCrowFlight.AshCrowFlight | ( | ) |
Will use a factor of 1.0 to calculate the estimated cost between nodes
| pathfinder.AshCrowFlight.AshCrowFlight | ( | double | factor | ) |
Create the heuristic.
| factor | scaling factor |
Estimate the cost between the node and the target.
Implements pathfinder.AstarHeuristic.