隨機佇列生成迷宮及按下空格求解
阿新 • • 發佈:2018-12-25
工具類
import java.awt.*;
import java.awt.geom.Ellipse2D;
import java.awt.geom.Rectangle2D;
import java.lang.InterruptedException;
public class AlgoVisHelper {
private AlgoVisHelper(){}
public static final Color Red = new Color(0xF44336);
public static final Color Pink = new Color(0xE91E63 );
public static final Color Purple = new Color(0x9C27B0);
public static final Color DeepPurple = new Color(0x673AB7);
public static final Color Indigo = new Color(0x3F51B5);
public static final Color Blue = new Color(0x2196F3);
public static final Color LightBlue = new Color(0x03A9F4);
public static final Color Cyan = new Color(0x00BCD4);
public static final Color Teal = new Color(0x009688);
public static final Color Green = new Color(0x4CAF50);
public static final Color LightGreen = new Color(0x8BC34A);
public static final Color Lime = new Color(0xCDDC39);
public static final Color Yellow = new Color(0xFFEB3B);
public static final Color Amber = new Color(0xFFC107);
public static final Color Orange = new Color(0xFF9800);
public static final Color DeepOrange = new Color(0xFF5722);
public static final Color Brown = new Color(0x795548);
public static final Color Grey = new Color(0x9E9E9E);
public static final Color BlueGrey = new Color(0x607D8B);
public static final Color Black = new Color(0x000000);
public static final Color White = new Color(0xFFFFFF);
public static void strokeCircle(Graphics2D g, int x, int y, int r){
Ellipse2D circle = new Ellipse2D.Double(x-r, y-r, 2*r, 2*r);
g.draw(circle);
}
public static void fillCircle(Graphics2D g, int x, int y, int r){
Ellipse2D circle = new Ellipse2D.Double(x-r, y-r, 2*r, 2*r);
g.fill(circle);
}
public static void strokeRectangle(Graphics2D g, int x, int y, int w, int h){
Rectangle2D rectangle = new Rectangle2D.Double(x, y, w, h);
g.draw(rectangle);
}
public static void fillRectangle(Graphics2D g, int x, int y, int w, int h){
Rectangle2D rectangle = new Rectangle2D.Double(x, y, w, h);
g.fill(rectangle);
}
public static void setColor(Graphics2D g, Color color){
g.setColor(color);
}
public static void setStrokeWidth(Graphics2D g, int w){
int strokeWidth = w;
g.setStroke(new BasicStroke(strokeWidth, BasicStroke.CAP_ROUND, BasicStroke.JOIN_ROUND));
}
public static void pause(int t) {
try {
Thread.sleep(t);
}
catch (InterruptedException e) {
System.out.println("Error sleeping");
}
}
}
資料層
實體類
public class MazeData {
public static final char ROAD = ' ';
public static final char WALL = '#';
private int N, M;
public char[][] maze;
public boolean[][] visited;
public boolean[][] inMist;
public boolean[][] path;
private int entranceX, entranceY;
private int exitX, exitY;
public MazeData(int N, int M){
if( N%2 == 0 || M%2 == 0)
throw new IllegalArgumentException("Our Maze Generalization Algorihtm requires the width and height of the maze are odd numbers");
this.N = N;
this.M = M;
maze = new char[N][M];
visited = new boolean[N][M];
inMist = new boolean[N][M];
path = new boolean[N][M];
// 繪製初始迷宮、形成一個個節點,後期進行連線形成迷宮
for(int i = 0 ; i < N ; i ++)
for(int j = 0 ; j < M ; j ++){
if(i%2 == 1 && j%2 == 1)
maze[i][j] = ROAD;
else
maze[i][j] = WALL;
visited[i][j] = false;
inMist[i][j] = true;
path[i][j] = false;
}
entranceX = 1;
entranceY = 0;
exitX = N - 2;
exitY = M - 1;
maze[entranceX][entranceY] = ROAD;
maze[exitX][exitY] = ROAD;
}
public int N(){ return N; }
public int M(){ return M; }
public int getEntranceX(){ return entranceX; }
public int getEntranceY(){ return entranceY; }
public int getExitX(){ return exitX; }
public int getExitY(){ return exitY; }
public boolean inArea(int x, int y){
return x >= 0 && x < N && y >= 0 && y < M;
}
public void openMist(int x, int y){
if(!inArea(x, y))
throw new IllegalArgumentException("x or y is out of index in openMist function!");
// 開啟當前座標的3*3的迷霧
for(int i = x-1 ; i <= x+1 ; i ++)
for(int j = y-1 ; j <= y+1 ; j++)
if(inArea(i,j))
inMist[i][j] = false;
return;
}
}
public class Position {
private int x, y;
public Position(int x, int y){
this.x = x;
this.y = y;
}
public int getX(){return x;}
public int getY(){return y;}
}
佇列類
import java.util.LinkedList;
public class RandomQueue<E>{
private LinkedList<E> queue;
public RandomQueue(){
queue = new LinkedList<E>();
}
public void add(E e){
// 隨機插入佇列頭部元素貨尾部元素
if(Math.random() < 0.5)
queue.addFirst(e);
else
queue.addLast(e);
}
public E remove(){
if(queue.size() == 0)
throw new IllegalArgumentException("There's no element to remove in Random Qeuue");
// 隨機取出佇列頭部元素貨尾部元素
if(Math.random() < 0.5)
return queue.removeFirst();
else
return queue.removeLast();
}
public int size(){
return queue.size();
}
public boolean empty(){
return size() == 0;
}
}
檢視類
import java.awt.Dimension;
import java.awt.Graphics;
import java.awt.Graphics2D;
import java.awt.RenderingHints;
import javax.swing.JFrame;
import javax.swing.JPanel;
public class AlgoFrame extends JFrame{
private int canvasWidth;
private int canvasHeight;
public AlgoFrame(String title, int canvasWidth, int canvasHeight){
super(title);
this.canvasWidth = canvasWidth;
this.canvasHeight = canvasHeight;
AlgoCanvas canvas = new AlgoCanvas();
setContentPane(canvas);
pack();
setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
setResizable(false);
setVisible(true);
}
public AlgoFrame(String title){
this(title, 1024, 768);
}
public int getCanvasWidth(){return canvasWidth;}
public int getCanvasHeight(){return canvasHeight;}
// data
private MazeData data;
public void render(MazeData data){
this.data = data;
repaint();
}
private class AlgoCanvas extends JPanel{
public AlgoCanvas(){
// 雙快取
super(true);
}
@Override
public void paintComponent(Graphics g) {
super.paintComponent(g);
Graphics2D g2d = (Graphics2D)g;
// 抗鋸齒
RenderingHints hints = new RenderingHints(
RenderingHints.KEY_ANTIALIASING,
RenderingHints.VALUE_ANTIALIAS_ON);
hints.put(RenderingHints.KEY_RENDERING, RenderingHints.VALUE_RENDER_QUALITY);
g2d.addRenderingHints(hints);
// 具體繪製
int w = canvasWidth/data.M();
int h = canvasHeight/data.N();
for(int i = 0 ; i < data.N() ; i ++ )
for(int j = 0 ; j < data.M() ; j ++){
// 迷霧是否開啟
if(data.inMist[i][j])
AlgoVisHelper.setColor(g2d, AlgoVisHelper.Black);
else{
// 是否為牆
if(data.maze[i][j] == MazeData.WALL)
AlgoVisHelper.setColor(g2d, AlgoVisHelper.LightBlue);
else
AlgoVisHelper.setColor(g2d, AlgoVisHelper.White);
//是否為路徑
if(data.path[i][j])
AlgoVisHelper.setColor(g2d, AlgoVisHelper.Yellow);
}
AlgoVisHelper.fillRectangle(g2d, j * w, i * h, w, h);
}
}
@Override
public Dimension getPreferredSize(){
return new Dimension(canvasWidth, canvasHeight);
}
}
}
控制類
import java.awt.EventQueue;
import java.awt.event.KeyAdapter;
import java.awt.event.KeyEvent;
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(int N, int M){
// 初始化資料
data = new MazeData(N, M);
int sceneHeight = data.N() * blockSide;
int sceneWidth = data.M() * blockSide;
// 初始化檢視
EventQueue.invokeLater(() -> {
frame = new AlgoFrame("Random Maze Generation Visualization", sceneWidth, sceneHeight);
frame.addKeyListener(new AlgoKeyListener());
new Thread(() -> {
run();
}).start();
});
}
private void run(){
setRoadData(-1, -1);
// 新建隨機佇列
RandomQueue<Position> queue = new RandomQueue<Position>();
Position first = new Position(data.getEntranceX(), data.getEntranceY()+1);
queue.add(first);
// 將當前座標設為以處理
data.visited[first.getX()][first.getY()] = true;
// 開啟迷霧
data.openMist(first.getX(), first.getY());
while(queue.size() != 0){
Position curPos = queue.remove();
for(int i = 0 ; i < 4 ; i ++){
// 找到需要連線的節點座標
int newX = curPos.getX() + d[i][0]*2;
int newY = curPos.getY() + d[i][1]*2;
// 判斷該座標是否出界是否以處理,沒處理則新增入佇列,設為以處理開啟迷霧將2個座標中間的牆變路徑
if(data.inArea(newX, newY) && !data.visited[newX][newY]){
queue.add(new Position(newX, newY));
data.visited[newX][newY] = true;
data.openMist(newX, newY);
setRoadData(curPos.getX() + d[i][0], curPos.getY() + d[i][1]);
}
}
}
setRoadData(-1, -1);
}
private void setRoadData(int x, int y){
if(data.inArea(x, y))
data.maze[x][y] = MazeData.ROAD;
frame.render(data);
AlgoVisHelper.pause(DELAY);
}
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;
setPathData(x, y, true);
// 如果為出口返回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.maze[newX][newY] == MazeData.ROAD &&
!data.visited[newX][newY])
if(go(newX, newY))
return true;
}
// 回溯
setPathData(x, y, false);
return false;
}
private void setPathData(int x, int y, boolean isPath){
if(data.inArea(x, y))
data.path[x][y] = isPath;
frame.render(data);
AlgoVisHelper.pause(DELAY);
}
private class AlgoKeyListener extends KeyAdapter{
@Override
public void keyReleased(KeyEvent event){
// 監聽事件為空格的話,將所以座標變問未處理,在調取回溯演算法迷宮求解
if(event.getKeyChar() == ' '){
for(int i = 0 ; i < data.N() ; i ++)
for(int j = 0 ; j < data.M() ; j ++)
data.visited[i][j] = false;
new Thread(() -> {
go(data.getEntranceX(), data.getEntranceY());
}).start();
}
}
}
public static void main(String[] args) {
int N = 101;
int M = 101;
AlgoVisualizer vis = new AlgoVisualizer(N, M);
}
}
執行效果圖