BFS广度搜索(最短路径问题)

public class TuBFS {
static Queue<Integer> q = new LinkedBlockingQueue<>();
//初始化路径
static int[][] arrays = {
{ 0, 1, 1, 1, 0, 0, 0 },
{ 1, 0, 1, 1, 1, 0, 0 },
{ 1, 1, 0, 0, 0, 0, 1 },
{ 1, 1, 0, 0, 0, 1, 0 },
{ 0, 1, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 1, 0, 0, 1 },
{ 0, 0, 1, 0, 0, 1, 0 }, };

public static void main(String[] args) {
bfs();
}

static void bfs() {
int[][] visit = new int[7][7];
int x = 0;
q.add(x);
while (true) {
x = q.poll();
for (int i = 0; i < 7; i++) {
if (arrays[x][i] == 0 || visit[x][i] == 1) {

} else {
System.out.println(x + "-" + i);
visit[x][i] = 1;
q.add(i);
if (i == 6) {
System.out.println("到达");
return;

}
}
}
}
}
}