一个关於迷宫算法的JAVA程序.docVIP

import java.util.Scanner; import java.util.Stack; public class MiGong { private class Point { int x = 0; int y = 0; public Point() { this(0, 0); } public Point(int x, int y) { this.x = x; this.y = y; } public boolean equals(Point p) { return (x == p.x) (y == p.y); } @Override public String toString() { return ( + x + , + y + ); } } private int[][] maze = null; // 迷宫图 private StackPoint stack = new StackPoint(); // 保存路径的栈 public MiGong(int[][] maze) { this.maze = maze; } public void go() { Point out = new Point(maze.length - 1, maze[0].length -