astarnode.java

来自「A*算法的一些资料」· Java 代码 · 共 46 行

/**
 *
 * @author [e-mail]
 */
import java.util.*;
import java.math.*;
public class AStarNode {
    
    /** Creates a new instance of AStarNode */
    public AStarNode(String name,int x,int y) {
        neighbors=new LinkedList();
        this.x=x;
        this.y=y;
        this.name=name;
    }
    String name;
    int costFromStart;    
    int estimatedCostToGoal;
    int x,y;
    AStarNode pathParent;
    List neighbors;
    
    public String toString() {
        return name;
    }
    
    public int getEstimatedCost(AStarNode node){  //
        int dx=this.x-node.x;
        int dy=this.y-node.y;
       return (int)Math.sqrt(dx*dx+dy*dy);
    }
    
    public List getNeighbors(){
        return neighbors;
    }
    
    public int getCost(AStarNode node){
        int dx=this.x-node.x;
        int dy=this.y-node.y;
        return (int)Math.sqrt(dx*dx+dy*dy);
    }

    
}