用回溯法求迷宫出口

package hello;

import java.awt.*;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.Random;
import java.util.Stack;

import javax.swing.*;

public class Maze extends JFrame {

    /**
     * 
     */
    private static final long serialVersionUID = 1L;
    /*
     * 界面布局
     */
    JPanel p = new JPanel(new BorderLayout());
    jpanelp1 p1 = new jpanelp1();
    JPanel p2 = new JPanel(new GridLayout(1, 2, 5, 5));
    Button b1 = new Button("刷新");
    Button b2 = new Button("寻路");

    /*
     * Launch the application.
     */
    public static void main(String[] args) {
        Maze frame = new Maze();
        frame.setTitle("七彩迷宫");
        frame.setSize(700, 700);
        frame.setLocationRelativeTo(null);
        frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
        frame.setVisible(true);
    }

    /*
     * Create the frame.
     */
    public Maze() {
        add(p);
        p.add(p1, BorderLayout.CENTER);
        p.add(p2, BorderLayout.SOUTH);
        p2.add(b1);
        p2.add(b2);
        b1.addActionListener(new refreshListener());
        b2.addActionListener(new findPathListener());

    }

    /*
     * refreshListener
     */
    class refreshListener implements ActionListener {
        public void actionPerformed(ActionEvent e) {
            // p1.removeAll();
            // p1.repaint();
            // p1.init();
            p.removeAll();
            p.repaint();
            p1 = new jpanelp1();
            p.add(p1, BorderLayout.CENTER);
            p.add(p2, BorderLayout.SOUTH);
            p.updateUI();
        }
    }

    /*
     * findPathListener
     */
    class findPathListener implements ActionListener {
        public void actionPerformed(ActionEvent e) {
            p1.findPath();
        }
    }

    class Position {
        public Position() {

        }

        public Position(int row, int col) {
            this.col = col;
            this.row = row;
        }

        public String toString() {
            return "(" + row + " ," + col + ")";
        }

        int row;
        int col;
    }

    /*
     * maze JPanel
     */
    class jpanelp1 extends JPanel {
        /**
         * 
         */
        private static final long serialVersionUID = 1L;
        JButton buttons[][];
        int ibuttons[][];
        boolean bbuttons[][];
        Stack<Position> stack;

        public jpanelp1() {
            setLayout(new GridLayout(18, 18));
            stack = new Stack<Position>();
            buttons = new JButton[18][18];
            ibuttons = new int[18][18]; // 存放迷宫数值
            bbuttons = new boolean[18][18]; // 存放迷宫访问值
            init();
        }

        // 初始化函数
        public void init() {
            for (int i = 0; i < 18; i++) {
                for (int j = 0; j < 18; j++) {
                    buttons[i][j] = new JButton();
                    add(buttons[i][j]);
                    buttons[i][j].setMargin(new Insets(0, 0, 0, 0));
                }
            }

            // 生成迷宫数组
            int a;
            for (int i = 1; i < 17; i++) {
                for (int j = 1; j < 17; j++) {
                    Random random1 = new Random();
                    a = random1.nextInt(4);
                    if (a >= 1)
                        a = 1;
                    ibuttons[i][j] = a;
                    bbuttons[i][j] = false;
                }
            }

            // 给迷宫四面加墙
            for (int i = 0; i < 18; ++i) {
                for (int j = 0; j < 18; ++j) {
                    ibuttons[0][j] = ibuttons[17][j] = 0;
                    ibuttons[i][0] = ibuttons[i][17] = 0;
                    buttons[i][j].setBackground(Color.blue);
                }
            }

            // 确定出口、入口
            buttons[0][1].setBackground(Color.green);
            String str1 = new String("入口");
            buttons[0][1].setText(str1);
            buttons[17][16].setBackground(Color.green);
            String str2 = new String("出口");
            buttons[17][16].setText(str2);
            for (int i = 1; i < 17; i++) {
                for (int j = 1; j < 17; j++) {
                    {
                        // 显示迷宫存放整形值
                        // String s = String.valueOf(ibuttons[i][j]);
                        // buttons[i][j].setText(s);
                        switch (ibuttons[i][j]) {
                        case 0:
                            buttons[i][j].setBackground(Color.blue);
                            break;
                        case 1:
                            buttons[i][j].setBackground(Color.green);
                            break;
                        default:
                            break;
                        }
                    }
                }
            }
        }

        // 回溯法查找路线
        public void findPath() {
            int i = 1;
            int j = 1;
            bbuttons[i][j] = true;
            if (ibuttons[i][j] != 0)
                stack.push(new Position(i, j));
            while (!stack.empty() && !(i == 16 && j == 16) && i > 0 && j > 0) {
                if ((ibuttons[i][j + 1] != 0) && (bbuttons[i][j + 1] == false)) {
                    bbuttons[i][j + 1] = true;
                    stack.push(new Position(i, j + 1));
                    j++;
                } else if ((ibuttons[i + 1][j] != 0)
                        && (bbuttons[i + 1][j] == false)) {
                    bbuttons[i + 1][j] = true;
                    stack.push(new Position(i + 1, j));
                    i++;
                } else if ((ibuttons[i][j - 1] != 0)
                        && (bbuttons[i][j - 1] == false)) {
                    bbuttons[i][j - 1] = true;
                    stack.push(new Position(i, j - 1));
                    j--;
                } else if ((ibuttons[i - 1][j] != 0)
                        && (bbuttons[i - 1][j] == false)) {
                    bbuttons[i - 1][j] = true;
                    stack.push(new Position(i - 1, j));
                    i--;
                } else {
                    stack.pop();
                    if (stack.empty()) {
                        break;
                    }
                    i = stack.peek().row;
                    j = stack.peek().col;
                }
            }
            if (stack.empty()) {
                String message = "该迷宫无出路！";
                JOptionPane.showMessageDialog(null, message);
                // 确认无路可走，再次初始化迷宫
                p1.removeAll();
                p1.init();
            } else {
                int x, y;
                while (!stack.empty()) {
                    x = stack.peek().row;
                    y = stack.peek().col;
                    buttons[x][y].setBackground(Color.red);
                    stack.pop();
                }
                p1.repaint();
            }
        }
    }
}

下载链接: http://pan.baidu.com/s/1gdqpZ71 密码: ybp9