java遍历迷宫代码,java：广度首次遍历与迷宫回溯

我正试图在迷宫中实现广度优先遍历。这是我迄今使用链表的代码，但我不确定它是否首先搜索宽度。这是做到这一点的正确方法吗？任何建议，意见？

public boolean traverseBreadth(){

//traverse the floor from entrance to exit

//stepping only on red tiles

steps = new LinkedList();

possibleSteps = new LinkedList();

//reset markings

reset();

//push the entrance onto the stack

entrance.setVisited();

steps.add(entrance);

System.out.println("add " + entrance);

nextMoves(entrance);

//keep going as long as we have a possibility to move

//and we haven't reached the end yet

while (!possibleSteps.isEmpty()&& (!possibleSteps.getLast().equals(exit)))

{

Tile x = possibleSteps.removeLast();

x.setMarked(); //walked on that square

steps.add(x); //walk to that square

System.out.println("Walked to the square " + x);

//now figure out where you can walk from this square

nextMoves(x);

try {

Thread.currentThread().sleep(1000);

}

catch (InterruptedException e) {

e.printStackTrace();

}

}

if (possibleSteps.getLast().equals(exit)){

steps.push(possibleSteps.removeLast());

System.out.println("made it from entrance to exit");

System.out.println(steps.toString());

return true;

}

else

{ JOptionPane.showMessageDialog(null,"sorry can't reach the exit");

return false;

}

}