fixed heap error

Author: vmsaif

A2_Q1/src/AStarSearch.java

@@ -1,5 +1,5 @@
 
-import java.util.ArrayList;
+import java.util.LinkedList;
 import java.util.PriorityQueue;
 import javax.swing.JPanel;
 
@@ -9,7 +9,7 @@ public class AStarSearch extends JPanel {
     private Tile start;
     private Tile goal;
     private Ant ant;
-    private ArrayList<ArrayList<Tile>> allPath2D = new ArrayList<ArrayList<Tile>>();
+    private LinkedList<LinkedList<Tile>> allPath2D = new LinkedList<LinkedList<Tile>>();
 
     public AStarSearch(Tile[][] tiles, Ant ant, Tile start, Tile goal) {
         this.tiles = tiles;
@@ -18,10 +18,10 @@ public AStarSearch(Tile[][] tiles, Ant ant, Tile start, Tile goal) {
         this.ant = ant;
     }
 
-    public ArrayList<Tile> search() {
+    public LinkedList<Tile> search() {
 
-        ArrayList<Tile> output = new ArrayList<>();
-        ArrayList<Tile> closedSet = new ArrayList<>();
+        LinkedList<Tile> output = new LinkedList<>();
+        LinkedList<Tile> closedSet = new LinkedList<>();
 
         // create openSet and add start to it
         PriorityQueue<Tile> openSet = new PriorityQueue<Tile>();
@@ -35,7 +35,7 @@ public ArrayList<Tile> search() {
         // while openSet is not empty
         while (openSet.size() > 0 && foundGoal == false && noPath == false) {
             // create a row for each iteration for drawing purposes
-            ArrayList<Tile> row = new ArrayList<>();
+            LinkedList<Tile> row = new LinkedList<>();
 
             // check if first element in openSet is goal
             Tile current = openSet.poll();
@@ -172,8 +172,8 @@ private PriorityQueue<Tile> getNeighbors(Tile tile) {
         return neighbors;
     }
 
-    public ArrayList<Tile> reconstructPath(Tile current) {
-        ArrayList<Tile> path = new ArrayList<>();
+    public LinkedList<Tile> reconstructPath(Tile current) {
+        LinkedList<Tile> path = new LinkedList<>();
 
         while (current != null) {
             path.add(current);

A2_Q1/src/Ant.java

@@ -7,7 +7,7 @@
 import java.awt.Image;
 import java.io.File;
 import java.io.IOException;
-import java.util.ArrayList;
+import java.util.LinkedList;
 
 import javax.imageio.ImageIO;
 
@@ -19,11 +19,11 @@ public class Ant {
     private Tile goal;
     private Tile[][] tiles;
     private Image antImage;
-    private ArrayList<Tile> path;
+    private LinkedList<Tile> path;
     private Graphics g;
 
     private AStarSearch aStarSearch;
-    private ArrayList<ArrayList<Tile>> allPath2D = new ArrayList<ArrayList<Tile>>();
+    private LinkedList<LinkedList<Tile>> allPath2D = new LinkedList<LinkedList<Tile>>();
 
     public Ant(Tile start, Tile goal, int tileSize, Tile[][] tiles) {
         this.start = start;
@@ -52,21 +52,21 @@ public void search() {
         path = aStarSearch.search();
     }
 
-    public ArrayList<Tile> getPath() {
+    public LinkedList<Tile> getPath() {
 
-        // find the path and store it in path arraylist
+        // find the path and store it in path LinkedList
         if(path == null){
             this.search();
         }
         return path;
     }
 
 
-    public void setAllPath2D(ArrayList<ArrayList<Tile>> allPath2D) {
+    public void setAllPath2D(LinkedList<LinkedList<Tile>> allPath2D) {
         this.allPath2D = allPath2D;
     }
 
-    public ArrayList<ArrayList<Tile>> getAllPath2D() {
+    public LinkedList<LinkedList<Tile>> getAllPath2D() {
         return allPath2D;
     }
 

A2_Q1/src/Game.java

@@ -33,7 +33,7 @@ The robot character (an ant) should find its way from the start point (home) to
 import java.awt.event.MouseListener;
 import java.io.File;
 import java.io.IOException;
-import java.util.ArrayList;
+import java.util.LinkedList;
 import javax.swing.Timer;
 import javax.imageio.ImageIO;
 import javax.swing.JButton;
@@ -47,7 +47,7 @@ public class Game extends JPanel implements MouseListener {
 
     private Ant ant;
     private Tile[][] tiles;
-    private ArrayList<Tile> tobeDrawn;
+    private LinkedList<Tile> tobeDrawn;
     private boolean startMovingAnt;
 
     private Tile startTile;
@@ -91,7 +91,7 @@ public Game() {
         startTile = null;
         goalTile = null;
         startMovingAnt = false;
-        tobeDrawn = new ArrayList<Tile>();
+        tobeDrawn = new LinkedList<Tile>();
     }
 
     private void loadFoodImg() {
@@ -335,7 +335,7 @@ private Tile fetchTile(int mouseX, int mouseY) {
     public void delayPaint() {
         int delay = 100; // 1 second delay
         Timer timer = new Timer(delay, new ActionListener() {
-            ArrayList<ArrayList<Tile>> allPath2D = ant.getAllPath2D();
+            LinkedList<LinkedList<Tile>> allPath2D = ant.getAllPath2D();
             Tile subNodeToBeDrawn = null;
             Tile mainNode;
 
@@ -357,7 +357,7 @@ public void actionPerformed(ActionEvent e) {
                     }
 
                     // add main node which will stay there parmanently to be drawn.
-                    ArrayList<Tile> oneIterationArray = allPath2D.get(0);
+                    LinkedList<Tile> oneIterationArray = allPath2D.get(0);
 
                     if (oneIterationArray.size() > 0 && addMainNode) {
                         mainNode = oneIterationArray.get(0);
@@ -398,7 +398,7 @@ public void animateAnt() {
         if (startMovingAnt) {
             double speed = 1.5;
             int delay = 10; // 0.1 second delay
-            ArrayList<Tile> path = ant.getPath();
+            LinkedList<Tile> path = ant.getPath();
 
             // set the ant to the start location
             ant.setX(path.get(path.size() - 1).getX() * TILE_SIZE);
@@ -473,16 +473,16 @@ protected void paintComponent(Graphics g) {
         drawPath(g, TILE_SIZE, tobeDrawn);
     } // end paintComponent
 
-    public void drawPath(Graphics g, int tileSize, ArrayList<Tile> arrayList) {
+    public void drawPath(Graphics g, int tileSize, LinkedList<Tile> LinkedList) {
 
-        if (arrayList != null && arrayList.size() > 1) {
+        if (LinkedList != null && LinkedList.size() > 1) {
             g.setColor(Color.RED);
 
-            for (int i = 0; i < arrayList.size() - 1; i++) {
+            for (int i = 0; i < LinkedList.size() - 1; i++) {
 
-                Tile current = arrayList.get(i);
+                Tile current = LinkedList.get(i);
 
-                Tile next = arrayList.get(i + 1);
+                Tile next = LinkedList.get(i + 1);
 
                 int x1 = (int) current.getX() * tileSize + tileSize / 2;
                 int y1 = (int) current.getY() * tileSize + tileSize / 2;