-
Notifications
You must be signed in to change notification settings - Fork 173
/
Copy pathAlgoVisualizer.java
81 lines (58 loc) · 2.05 KB
/
AlgoVisualizer.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
import java.awt.*;
public class AlgoVisualizer {
private static int DELAY = 5;
private static int blockSide = 8;
private MazeData data;
private AlgoFrame frame;
private static final int d[][] = {{-1,0},{0,1},{1,0},{0,-1}};
public AlgoVisualizer(String mazeFile){
// 初始化数据
data = new MazeData(mazeFile);
int sceneHeight = data.N() * blockSide;
int sceneWidth = data.M() * blockSide;
// 初始化视图
EventQueue.invokeLater(() -> {
frame = new AlgoFrame("Maze Solver Visualization", sceneWidth, sceneHeight);
new Thread(() -> {
run();
}).start();
});
}
public void run(){
setData(-1, -1, false);
if(!go(data.getEntranceX(), data.getEntranceY()))
System.out.println("The maze has NO solution!");
setData(-1, -1, false);
}
// 从(x,y)的位置开始求解迷宫,如果求解成功,返回true;否则返回false
private boolean go(int x, int y){
if(!data.inArea(x,y))
throw new IllegalArgumentException("x,y are out of index in go function!");
data.visited[x][y] = true;
setData(x, y, true);
if(x == data.getExitX() && y == data.getExitY())
return true;
for(int i = 0 ; i < 4 ; i ++){
int newX = x + d[i][0];
int newY = y + d[i][1];
if(data.inArea(newX, newY) &&
data.getMaze(newX,newY) == MazeData.ROAD &&
!data.visited[newX][newY])
if(go(newX, newY))
return true;
}
// 回溯
setData(x, y, false);
return false;
}
private void setData(int x, int y, boolean isPath){
if(data.inArea(x, y))
data.path[x][y] = isPath;
frame.render(data);
AlgoVisHelper.pause(DELAY);
}
public static void main(String[] args) {
String mazeFile = "maze_101_101.txt";
AlgoVisualizer vis = new AlgoVisualizer(mazeFile);
}
}