coor.java

来自「java编写的最短路径算法」· Java 代码 · 共 20 行

package integrate;

public class Coor {
	public int layer;
	public int rank;
	public int use;
	public Coor(){
		layer=1;
		rank=1;
		use=0;
	}
	public int isValid(){
		if ((layer<1) || (layer>5))
			return 0;
		if ((rank<0) || (rank>8))
			return 0;
		return 1;
	}
}