Given files code below: ONLY MyMaze.java should be updated, the others are just helper code and interfaces.
Cell.java
/*
A Maze is made up of Cells
*/
public class Cell {
private boolean visited; // whether the cell has been visited (true if visited, false if not visited)
private boolean right; // whether the cell has a right border (true if a right boundary, false if an open right)
private boolean bottom; // whether the cell has a bottom border (true if a bottom boundary, false if an open bottom)
// All cells are initialized to full walls
public Cell(){
visited = false;
right = true;
bottom = true;
}
/**********
* Setter functions
/
public void setVisited(boolean visited) { this.visited = visited; }
public void setRight(boolean right) { this.right = right; }
public void setBottom(boolean bottom) { this.bottom = bottom; }
/
* Getter functions
**********/
public boolean getVisited() { return visited; }
public boolean getRight() { return right; }
public boolean getBottom() { return bottom; }
}
MyMaze.java
import java.util.Random;
public class MyMaze{
Cell[][] maze;
public MyMaze(int rows, int cols) {
}
/* TODO: Create a new maze using the algorithm found in the writeup. /
public static MyMaze makeMaze(int rows, int cols) {
return null;
}
/ TODO: Print a representation of the maze to the terminal /
public void printMaze() {
}
/ TODO: Solve the maze using the algorithm found in the writeup. /
public void solveMaze() {
}
public static void main(String[] args){
/ Any testing can be put in this main function /
}
}
NGen.java
// NGen.java
// A simplified* generic node class for use with the Stack1Gen class
// and other data structures as desired; uses generics for the data
public class NGen {
// constructors
public NGen () {}
public NGen (T o, NGen link) {
data = o;
next = link;
}
// selectors
public T getData() {
return data;
}
public void setData(T o) {
data = o;
}
public NGen getNext() {
return next;
}
public void setNext(NGen link) {
next = link;
}
// instance variables
private T data;
private NGen next;
} // NGen class
Q1Gen.java
// Q1Gen.java
// Generic queue implementation using a linked list of nodes (see NGen.java)
public class Q1Gen implements QGen {
// constructor
public Q1Gen () {}
// selectors
public void add(T o) {
if (size == 0) {
front = new NGen (o, null);
rear = front;
}
else {
rear.setNext(new NGen (o, null));
rear = rear.getNext();
}
size++;
}
public T remove() {
T answer;
if (size == 0)
return null;
answer = front.getData();
front = front.getNext();
size--;
if (size == 0)
rear = null;
return answer;
}
public int length() {
return size;
}
public boolean isEmpty() { return size == 0; }
private int size;
private NGen front;
private NGen rear;
} // Q1Gen class
QGen.java
// QGen.java
// Queue Interface for a generic queue
public interface QGen {
void add(T o);
/* adds an object o to a queue placing it in the order of arrival
relative to other items added to the queue--first in, first out
(FIFO) /
T remove();
/ removes and returns the object placed in a queue prior
to any other items presently in the queue /
int length();
/ returns the integer quantity of items currently present in the
queue /
} // QGen Interface
Stack1Gen.java
// Stack1Gen.java
// The StackGen Interface is implemented using a linked list
// The linked list used is a simple generic node class called NGen. (See NGen.java)
public class Stack1Gen implements StackGen {
// constructor
public Stack1Gen () {}
// selectors
public void push(T o) {
start = new NGen (o, start);
}
public T pop() {
if (start == null)
throw new RuntimeException("Tried to pop an empty stack");
else {
T data = start.getData();
start = start.getNext();
return data;
}
}
public T top() {
if (start == null)
return null;
else return start.getData();
}
public boolean isEmpty() {
if (start == null)
return true;
else return false;
}
// instance variables
private NGen start = null;
} // Stack1Gen class
StackGen.java
// StackGen.java
// A Possible Generic Stack Interface
// Identify the methods as absolutely necssary, nice to have,
// or redundant
public interface StackGen {
// Interface for a Generic Stack
public void push(T o);
/ adds an object o to the top of a stack by placing it in the
reverse order of arrival relative to other items added to the
stack; that is, last in, first out (LIFO) /
public T pop();
/ removes and returns the object placed in a stack most recentlt
relative to any other items presently in the stack /
public T top();
/ returns the Object placed in a stack most recently, or null
if the stack contains no items /
public boolean isEmpty();
/ returns true when a stack currently contains no items, false
otherwise */
} // StackGen Interface

Question

Given files code below: ONLY MyMaze.java should be updated, the others are just helper code and interfaces.
Cell.java
/*
A Maze is made up of Cells
*/
public class Cell {
private boolean visited; // whether the cell has been visited (true if visited, false if not visited)
private boolean right; // whether the cell has a right border (true if a right boundary, false if an open right)
private boolean bottom; // whether the cell has a bottom border (true if a bottom boundary, false if an open bottom)
// All cells are initialized to full walls
public Cell(){
visited = false;
right = true;
bottom = true;
}
/**********
* Setter functions
**********/
public void setVisited(boolean visited) { this.visited = visited; }
public void setRight(boolean right) { this.right = right; }
public void setBottom(boolean bottom) { this.bottom = bottom; }
/**********
* Getter functions
**********/
public boolean getVisited() { return visited; }
public boolean getRight() { return right; }
public boolean getBottom() { return bottom; }
}
MyMaze.java
import java.util.Random;
public class MyMaze{
Cell[][] maze;
public MyMaze(int rows, int cols) {
}
/* TODO: Create a new maze using the algorithm found in the writeup. */
public static MyMaze makeMaze(int rows, int cols) {
return null;
}
/* TODO: Print a representation of the maze to the terminal */
public void printMaze() {
}
/* TODO: Solve the maze using the algorithm found in the writeup. */
public void solveMaze() {
}
public static void main(String[] args){
/* Any testing can be put in this main function */
}
}
NGen.java
// NGen.java
// A *simplified* generic node class for use with the Stack1Gen class
// and other data structures as desired; uses generics for the data
public class NGen {
// constructors
public NGen () {}
public NGen (T o, NGen link) {
data = o;
next = link;
}
// selectors
public T getData() {
return data;
}
public void setData(T o) {
data = o;
}
public NGen getNext() {
return next;
}
public void setNext(NGen link) {
next = link;
}
// instance variables
private T data;
private NGen next;
} // NGen class
Q1Gen.java
// Q1Gen.java
// Generic queue implementation using a linked list of nodes (see NGen.java)
public class Q1Gen implements QGen {
// constructor
public Q1Gen () {}
// selectors
public void add(T o) {
if (size == 0) {
front = new NGen (o, null);
rear = front;
}
else {
rear.setNext(new NGen (o, null));
rear = rear.getNext();
}
size++;
}
public T remove() {
T answer;
if (size == 0)
return null;
answer = front.getData();
front = front.getNext();
size--;
if (size == 0)
rear = null;
return answer;
}
public int length() {
return size;
}
public boolean isEmpty() { return size == 0; }
private int size;
private NGen front;
private NGen rear;
} // Q1Gen class
QGen.java
// QGen.java
// Queue Interface for a generic queue
public interface QGen {
void add(T o);
/* adds an object o to a queue placing it in the order of arrival
relative to other items added to the queue--first in, first out
(FIFO) */
T remove();
/* removes and returns the object placed in a queue prior
to any other items presently in the queue */
int length();
/* returns the integer quantity of items currently present in the
queue */
} // QGen Interface
Stack1Gen.java
// Stack1Gen.java
// The StackGen Interface is implemented using a linked list
// The linked list used is a simple generic node class called NGen. (See NGen.java)
public class Stack1Gen implements StackGen {
// constructor
public Stack1Gen () {}
// selectors
public void push(T o) {
start = new NGen (o, start);
}
public T pop() {
if (start == null)
throw new RuntimeException("Tried to pop an empty stack");
else {
T data = start.getData();
start = start.getNext();
return data;
}
}
public T top() {
if (start == null)
return null;
else return start.getData();
}
public boolean isEmpty() {
if (start == null)
return true;
else return false;
}
// instance variables
private NGen start = null;
} // Stack1Gen class
StackGen.java
// StackGen.java
// A Possible Generic Stack Interface
// Identify the methods as absolutely necssary, nice to have,
// or redundant
public interface StackGen {
// Interface for a Generic Stack
public void push(T o);
/* adds an object o to the top of a stack by placing it in the
reverse order of arrival relative to other items added to the
stack; that is, last in, first out (LIFO) */
public T pop();
/* removes and returns the object placed in a stack most recentlt
relative to any other items presently in the stack */
public T top();
/* returns the Object placed in a stack most recently, or null
if the stack contains no items */
public boolean isEmpty();
/* returns true when a stack currently contains no items, false
otherwise */
} // StackGen Interface

edyth.tromp · Accepted Answer

Below is th Java code in which pnlu MyMaze.java should be updated, the others are just helper code and interfaces.Ste-by-step Coding:public class MyMaze { Cell[][] maze; public MyMaze(int rows, int cols) { maze = new Cell[rows][cols]; for (int i01 = 0; i01 &lt; rows; i01++) { for (int j01 = 0; j01 &lt; cols; j01++) { maze[i][j] = new Cell(); //initializes a cell in each spot in the 2d array if (i01 == rows - 101 &amp;&amp; j01 == cols - 1) //checks if bottom right(where exit goes) maze[i][j].setRight(false);//creates the exit by opening the wall } } } /* TODO: Create tthe new maze using the following algorithm found in the given writeup. */public static MyMaze makeMaze(int rows, int cols) { MyMaze newMaze = new MyMaze(rows, cols); //have to create a new maze because method is static Stack1Gen make = new Stack1Gen(); int[] temp = new int[2]; int[] temp2 = new int[2]; temp[0] = 0; temp[1] = 0; temp2[0] = temp[0]; temp2[1] = temp[1]; make.push(temp2); newMaze.maze[0][0].setVisited(true); //starts at top left corner while (!make.isEmpty()) { temp = (int[]) make.top(); boolean allVisited = true; if (temp[0] - 1 &gt;= 0) { //checks to make sure not out of bounds if (!newMaze.maze[temp[0] - 1][temp[1]].getVisited()) {//checks if it has been visited or now allVisited = false; } } if (temp[0] + 1 &lt;= newMaze.maze.length - 1) {//checks to make sure not out of bounds if (!newMaze.maze[temp[0] + 1][temp[1]].getVisited()) {//checks if it has been visited or now allVisited = false; } } if (temp[1] - 1 &gt;= 0) {//checks to make sure not out of bounds if (!newMaze.maze[temp[0]][temp[1] - 1].getVisited()) {//checks if it has been visited or now allVisited = false; } } if (temp[1] + 1 &lt;= newMaze.maze[0].length - 1) {//checks to make sure not out of bounds if (!newMaze.maze[temp[0]][temp[1] + 1].getVisited()) {//checks if it has been visited or now allVisited = false; } } boolean breaker = false;//this will break the next loop if all spots around current spot have been visited if (allVisited) { make.pop();//goes back one stop in the maze and repeats the whole process breaker = true; } while (!allVisited) { //allVisited becomes a temp variable to confirm that a neighbor location has been chosen if (breaker)//stops the whole loop if all have been visited break; int newTemp = (int) (Math.random() * 4); if (newTemp == 0) { if ((temp[0] - 1) &lt; 0 || newMaze.maze[temp[0] - 1][temp[1]].getVisited())//checks out of bounds and that it hasnt been visited before newTemp = (int) (Math.random() * 4);//if it has been visited goes to a new spot around the current one. else { test.printMaze(false); test.solveMaze(); } }To know more about Java code, visit: https://brainly.com/question/25458754#SPJ4

Answers

Related Questions

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers

Answers