package searchWay;

public class BidirectLinkNode {
	boolean everstepped;   //記錄是否走過，若是墻則也是True
	int x,y;               //記錄此節(jié)點對應(yīng)的地圖坐標(biāo)
	int index;				//記錄在隊中的位置
	BidirectLinkNode next;
	BidirectLinkNode prior;
	BidirectLinkNode fathernode;
	//構(gòu)造方法
	BidirectLinkNode() {}
    
	//構(gòu)造記錄自身位置的點
	BidirectLinkNode(int x,int y) {
	this.x = x;
	this.y = y;
    }
	  
	//構(gòu)造記錄自身位置和是否被經(jīng)過的點
	BidirectLinkNode(int x,int y,boolean everstepped){
		this.x = x;
		this.y = y;
//		this.dir=dir;
		this.everstepped=everstepped;
	}
	/*
    BidirectLinkNode(int dir, BidirectLinkNode next) {
	this.dir = dir;
	this.next = next;
	}
	BidirectLinkNode(int dir, BidirectLinkNode next,BidirectLinkNode prior) {
	this.dir = dir;
	this.prior = prior;
	this.next = next;
	}*/
}