List of usage examples for com.badlogic.gdx.ai.pfa Heuristic interface-usage
From source file br.cefetmg.games.pathfinding.HeuristicaDistanciaEuclidiana.java
/** * * @author Daniel */ public class HeuristicaDistanciaEuclidiana implements Heuristic<TileNode> {
From source file br.cefetmg.games.pathfinding.HeuristicaManhattan.java
/** * * @author Daniel */ public class HeuristicaManhattan implements Heuristic<TileNode> {
From source file br.cefetmg.games.pathfinding.HeuristicaNula.java
/** * * @author Daniel */ public class HeuristicaNula implements Heuristic<TileNode> {
From source file br.cefetmg.games.pathfinding.HeuristicEuclidean.java
/** * * @author Aluno */ public class HeuristicEuclidean implements Heuristic<TileNode> {
From source file br.cefetmg.games.pathfinding.HeuristicManhattan8D.java
/** * * @author Aluno */ public class HeuristicManhattan8D implements Heuristic<TileNode> {
From source file br.cefetmg.games.pathfinding.HeuristicNula.java
/** * * @author Aluno */ public class HeuristicNula implements Heuristic<TileNode> {
From source file com.badlogic.gdx.ai.tests.pfa.tests.tiled.TiledManhattanDistance.java
/** A Manhattan distance heuristic for a {@link TiledGraph}. It simply calculates the Manhattan distance between two given
* tiles.
*
* @param <N> Type of node, either flat or hierarchical, extending the {@link TiledNode} class
*
* @author davebaol */
From source file com.hindelid.demo.pathfindingtest.ManhattanDistanceHeuristic.java
public class ManhattanDistanceHeuristic implements Heuristic<TestNode> { @Override public float estimate(TestNode node, TestNode endNode) { return Math.abs(endNode.mX - node.mX) + Math.abs(endNode.mY - node.mY); }
From source file com.mygdx.game.pathfinding.NavMeshHeuristic.java
/** * @author jsjolund */ public class NavMeshHeuristic implements Heuristic<Triangle> { private final static Vector3 A_AB = new Vector3();
From source file gameplay.map.pathfinding.Heuristique.java
/** * * @author Stage */ public class Heuristique implements Heuristic<Tuile> {