java 迷宫_Java迷宫代码，深度优先遍历

/*** 描述: 迷宫的类型定义

*

* @Author shilei

* @Date 2019/5/18*/

public classMaze {//迷宫所有的路径存储在二维数组当中

privateMazeNode[][] maze;//存储迷宫路径节点的栈 深度优先

private Stackstack;//迷宫的行数

private introw;//迷宫的列数

private intcol;/*** 迷宫初始化

*@paramrow

*@paramcol*/

public Maze(int row, intcol) {this.row =row;this.col =col;this.maze = newMazeNode[row][col];this.stack = new Stack<>();}/*** 初始化指定位置的迷宫节点

*@paramdata

*@parami

*@paramj*/

public void initMazeNode(int data, int i, intj) {this.maze[i][j] = newMazeNode(data, i, j);

}/*** 修改迷宫所有节点四个方向的行走状态信息*/

public voidinitMazeNodePathState() {for (int i=0;i

maze[i][j].state[Constant.RIGHT]=true;

}if(i+1

maze[i][j].state[Constant.DOWN]=true;

}if(j>0&&maze[i][j-1].val==0){

maze[i][j].state[Constant.LEFT]=true;

}if(i>0&&maze[i-1][j].val==0){

maze[i][j].state[Constant.UP]=true;

}

}

}

}/*** 寻找迷宫路径*/

public voidfindMazePath() {//深度优先

if (maze[0][0].val != 0) {return;

}

stack.push(maze[0][0]);while (!stack.isEmpty()) {

MazeNode top=stack.peek();//找到出口

if (top.x == row - 1 && top.y == col - 1) {break;

}if(top.state[Constant.RIGHT]) {

top.state[Constant.RIGHT]= false;

stack.push(maze[top.x][top.y+ 1]);this.stack.peek().state[Constant.LEFT] = false;continue;

}if(top.state[Constant.DOWN]) {

top.state[Constant.DOWN]= false;

stack.push(maze[top.x+ 1][top.y]);this.stack.peek().state[Constant.UP] = false;continue;

}if(top.state[Constant.LEFT]) {

top.state[Constant.LEFT]= false;

stack.push(maze[top.x][top.y- 1]);this.stack.peek().state[Constant.RIGHT] = false;continue;

}if(top.state[Constant.UP]) {

top.state[Constant.UP]= false;

stack.push(maze[top.x- 1][top.y]);this.stack.peek().state[Constant.DOWN] = false;continue;

}

stack.pop();

}

}/*** 打印迷宫路径搜索的结果*/

public voidshowMazePath(){if(this.stack.isEmpty()){

System.out.println("迷宫出不去咯");

}else{while (!stack.isEmpty()){

MazeNode top=stack.pop();

maze[top.x][top.y].val='*';

}for (int i = 0; i

System.out.print("*"+" ");continue;

}

System.out.print(maze[i][j].val+" ");

}

System.out.println();

}

}

}/*** 描述: 定义迷宫节点类型*/

private static classMazeNode {//节点的值

intval;//节点的x和y坐标

intx;inty;//节点四个方向的行走状态，true表示可以走，false表示不能走

boolean[] state;/*** 迷宫路径初始化

*@paramdata

*@parami

*@paramj*/

public MazeNode(int data, int i, intj){this.state = new boolean[4];this.val =data;this.x =i;this.y =j;

}

}

}