node.java

寻找最短路径A_算法的实现

/*
 * Node.java
 *
 * Created on 2004年9月24日, 下午8:36
 */

/**
 *
 * @author  xhuad
 */
public class Node {  
    private int step;//从入口到该节点经历的步数
    private int pos;//位置
    private Node farther;//上一个结点
    private int judgeNum;
    public Node() {
    }
    public void setStep(int setStep){
        this.step = setStep;
    }
    public int getStep(){
        return this.step;
    }
    public void setPos(int setPos){
        this.pos = setPos;
    }
    public int getPos(){
        return this.pos;
    }
    public void setFarther(Node setNode){
        this.farther = setNode;;
    }
    public Node getFarther(){
        return this.farther;
    }
    public void setJudgeNum (int setInt){
        this.judgeNum = setInt;;
    }
    public int getJudgeNum(){
        return this.judgeNum;
    }
}