数据结构迷宫问题源代码

for(i=0;i<Col;i++)printf("%2d",i);printf("\n");for(i=0;i<Row;i++){printf("\t%2d",i);for(j=0;j<Col;j++){if(M[i][j]==1)printf("|||");elseif(M[i][j]==0)printf("");elseif(M[i][j]==2)printf("=");elseprintf("%c",M[i][j]);}printf("\n");}printf("\n");}intmain(){?intM[Row][Col]={ {1,1,1,1,1,1,1,1,1,1,1,1}, {1,0,0,0,1,1,0,1,1,1,0,1}, {1,0,1,0,0,1,0,0,1,0,0,1}, {1,0,1,1,0,0,0,1,1,0,1,1}, {1,0,0,1,0,1,0,0,0,0,0,1}, {1,1,0,1,0,1,1,0,1,0,1,1}, {1,0,0,1,0,0,0,0,1,1,1,1}, {1,0,1,0,1,1,1,1,0,0,1,1}, {1,0,0,0,0,1,1,0,0,0,1,1}, {1,0,1,0,1,0,0,0,1,0,0,1}, {1,0,0,0,0,0,1,0,0,1,0,1}, {1,1,1,1,1,1,1,1,1,1,1,1}?};?posTypestart,end;?start.x=1;start.y=1;?end.x=10;end.y=10;?printMaze(M,start,end);?if(Maze(M,start,end)){ printf("找到可行路径:\n"); printMaze(M,start,end);?}?elseprintf("无可行路径!\n");?system("pause");?return0;}