dpoint.java

利用深度遍历的方法来检查8数码问题是否有解。

public class DPoint implements Comparable
{
	public int x;
	public int y;

	public DPoint(int x,int y)
	{
		this.x=x;
		this.y=y;
	}
	
	public double distant(DPoint c)
	{
		return Math.sqrt(Math.pow((x-c.x),2)+Math.pow((y-c.y),2));
	}
	
	public int compareTo(Object e)
	{
		return x-((DPoint)e).x;
	}
	
	public String toString()
	{
		return "("+x+","+y+")";
	}
}