Examples of pathfinder.heuristics.DiagonalEqual

pathfinder.heuristics.DiagonalEqual
This heuristic function calculates minimal cost for regular maps with square tiles which allow diagonal movements. It assumes that cost of movement is equal in each direction. @author Egor Tsinko @param < T> type of the point. Must extend java.awt.Point

    assertTrue(gVal==(h6[2][2]+h6[1][1]));    
  }
  
  public void testGetHVal()
  {
    finder.setHeuristic(new DiagonalEqual());
    finder.findPath(new PathHelper(h6), new Point(0,0), new Point(2,2));
    
    double breaker = finder.getTieBreaker();
    
    List<Point> closed = finder.getVisitedPoints();

View Full Code Here

TOP

Related Classes of pathfinder.heuristics.DiagonalEqual

tests.PathFinderTest

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.