Chapter 06 codes updated.

Author: liuyubobobo

06-Maze-Generalization/04-Non-Recursive-DFS-Maze-Generalization/src/AlgoVisualizer.java

@@ -45,9 +45,7 @@ private void run(){
                 int newX = curPos.getX() + d[i][0]*2;
                 int newY = curPos.getY() + d[i][1]*2;
 
-                if(data.inArea(newX, newY)
-                        && !data.visited[newX][newY]
-                        && data.maze[newX][newY] == MazeData.ROAD){
+                if(data.inArea(newX, newY) && !data.visited[newX][newY]){
                     stack.push(new Position(newX, newY));
                     data.visited[newX][newY] = true;
                     setData(curPos.getX() + d[i][0], curPos.getY() + d[i][1]);

06-Maze-Generalization/05-BFS-Maze-Generalization/src/AlgoVisualizer.java

@@ -6,7 +6,7 @@
 
 public class AlgoVisualizer {
 
-    private static int DELAY = 20;
+    private static int DELAY = 5;
     private static int blockSide = 8;
 
     private MazeData data;

06-Maze-Generalization/06-Random-Maze-Generalization/src/RandomQueue.java

@@ -14,7 +14,7 @@ public void add(E e){
 
     public E remove(){
         if(queue.size() == 0)
-            throw new IllegalArgumentException("There's no element to remove in Random Qeuue");
+            throw new IllegalArgumentException("There's no element to remove in Random Queue");
 
         int randIndex = (int)(Math.random()*queue.size());
 

06-Maze-Generalization/07-Random-Maze-Generalization-with-Mist/src/AlgoVisualizer.java

@@ -1,7 +1,3 @@
-import javafx.geometry.Pos;
-
-import java.util.LinkedList;
-import java.util.Stack;
 import java.awt.*;
 
 public class AlgoVisualizer {

06-Maze-Generalization/08-More-about-Random-Maze-Generalization/02-More-about-Random-Maze-Generalization-with-Maze-Solver/src/AlgoFrame.java renamed to 06-Maze-Generalization/08-More-about-Random-Maze-Generalization/01-Problem-about-Current-Random-Maze-Generalization/src/AlgoFrame.java

@@ -45,9 +45,7 @@ private void run(){
                 int newX = curPos.getX() + d[i][0]*2;
                 int newY = curPos.getY() + d[i][1]*2;
 
-                if(data.inArea(newX, newY)
-                        && !data.visited[newX][newY]
-                        && data.maze[newX][newY] == MazeData.ROAD){
+                if(data.inArea(newX, newY) && !data.visited[newX][newY]){
                     queue.add(new Position(newX, newY));
                     data.visited[newX][newY] = true;
                     data.openMist(newX, newY);

06-Maze-Generalization/08-More-about-Random-Maze-Generalization/01-More-about-Random-Maze-Generalization/src/AlgoVisHelper.java renamed to 06-Maze-Generalization/08-More-about-Random-Maze-Generalization/01-Problem-about-Current-Random-Maze-Generalization/src/AlgoVisHelper.java

@@ -0,0 +1,35 @@
+import java.util.ArrayList;
+
+public class RandomQueue<E>{
+
+    private ArrayList<E> queue;
+
+    public RandomQueue(){
+        queue = new ArrayList<E>();
+    }
+
+    public void add(E e){
+        queue.add(e);
+    }
+
+    public E remove(){
+        if(queue.size() == 0)
+            throw new IllegalArgumentException("There's no element to remove in Random Qeuue");
+
+        int randIndex = (int)(Math.random()*queue.size());
+
+        E randElement = queue.get(randIndex);
+        queue.set(randIndex, queue.get(queue.size()-1));
+        queue.remove(queue.size()-1);
+
+        return randElement;
+    }
+
+    public int size(){
+        return queue.size();
+    }
+
+    public boolean empty(){
+        return size() == 0;
+    }
+}