graph/extra/heuristic_policy library
Classes
- HeuristicPolicyDijkstra
- Class for representing a heuristic for graph search algorithms based on Dijkstra's algorithm.
- HeuristicPolicyEuclid
- Class for representing a heuristic for graph search algorithms based on the euclidean distance. The heuristic assumes that the node have a position property of type {@link Vector3}.
- HeuristicPolicyEuclidSquared
- Class for representing a heuristic for graph search algorithms based on the squared euclidean distance. The heuristic assumes that the node have a position property of type {@link Vector3}.
- HeuristicPolicyManhattan
- Class for representing a heuristic for graph search algorithms based on the manhattan distance. The heuristic assumes that the node have a position property of type {@link Vector3}.