A星算法和深度优先.docxVIP

A*算法程序public class Eight{int g; int e[][]={{2,8,3},{1,6,4},{7,0,5}}; int zi,zj; //0的位置 Eight former; public Eight() { g=0; zi=-1; zj=-1; former=null; } public Eight(Eight other){ for(int i = 0; i3; i++) for(int j=0 ;j3; j++){ e[i][j] = other.e[i][j]; } zi=other.zi; zj=other.zj; former=other.former; } public void setFormer(Eight e){ this.former=e; } public void listAll( Eight e ){ System.out.println(最优路径为：); List l=new List(); l.insertAtFront(e); while( e.former != null ){ l.insertAtFront(e.former); e = new Eight(e.former); } while(!l.isEmpty()){ e=l.getFirstNode(); e.print(); l.removeFromFront(); } return ; } public boolean equals(Eight a) { int i=0; int j=0; if(a==null) return false; else { for( i = 0; i3; i++) for(j=0;j3; j++){ if(a.e[i][j] != this.e[i][j]) return false; } return true; } } public void Swap(int i,int j,int m,int n){int temp;temp = this.e[i][j];this.e[i][j] = this.e[m][n];this.e[m][n] = temp;} public int h(){ int dest[][] = {{1,2,3},{8,0,4},{7,6,5}}; int h =0,i,j; for(i=0;i3;i++) for(j=0;j3;j++){ if(this.e[i][j]!=dest[i][j] e[i][j]!=0) h++; } return h; } public int f(){ return g+h(); } public Eight[] ex(){ List e =new List(); int i=0,j=0,k=0; int m,n; boolean flag = true; for(i=0;i3flag;i++) for(j=0;j3flag;j++){ if(this.e[i][j]==0){ flag=false; break; } } i=i-1; if(i-1=0){ Eight a=new Eight(this); m=i-1; a.Swap(m,j,i,j); e.insertAtBack(a); ++k; } if(i+13){ Eight a=new Eight(this); m=i+1; a.Swap(m,j,i,j); e.insertAtBack(a); ++k; } if(j-1=0){ Eight a=new Eight(this); n=j-1; a.Swap(i,n,i,j); e.insertAtBack(a); ++k; } if(j+13){ Eight a=new Eight(this); n=j+1; a.Swap(i,n,i,j); e.insertAtBack(a); ++k; } Eight b[]=new Eight[k]; for(int x=0;xb.length;x++){ b[x]=e.getFirstNode(); b[x].setFormer(this); b[x].g=this.g+1; e.removeFromFront(); } return b; } static void sort(Eight a[]){ Eight temp; for(int i=0;ia.length;i++){ for(int j=a.length-1;ji;j--){ if(a[j].f()a[j-1].f()){ temp=a[j-1]; a[j-1]=a[j]; a[j]=temp; } } } } static void listSort(