Write a Maze data type that can read in .maze files, and print them out in the same format. A graph can represent a maze and there are many different ways to represent a graph in a computer program. You’ll use a simple data structure that works well when there are relatively few edges in the graph. You’ll store the vertices in an array rooms[], and refer to them by their index in the array. So vertex i means the vertex stored at rooms[i]. write a Vertex class. Each Vertex object stores a linked list of the edges leaving it. It also stores two ints, x and y, to indicate the position of the vertex/room in the maze and a string name for referring to it.
The purpose of name is strictly descriptive. For example, this would be where you would store the name of a lecture hall. Download the file [login to view URL] for the framework for the Vertex class. You will write the code for all the methods. The code for the constructor, setter, and getter methods are straightforward. The method addEdge adds the edge to the end of the linked list edges. The method getEdgesIterator just returns an iterator for the linked list edges. You cannot add additional methods or any nested classes to the Vertex class. You will write an Edge class. The data member edges of the Vertex class is a linked list of outgoing edges from that particular vertex. Each value in the linked list is an instance of the Edge class. Each Edge object in edges defines an outgoing edge from that particular vertex. Since we're storing the vertices in an array (rooms[]), an Edge object defining an edge only needs to contain the index of the vertex to which it is pointing in order to define an edge. Remember, this is a directed graph. You can make the corridors in your maze two-way by adding edges in each direction. If the edge is A to B, the Edge object defining this edge will be in the linked list of A and its target will be the index of B. Another way of thinking about this is that edges is just the list of vertices/rooms that can be reached directly from a vertex/room without going through any other vertex/room.
Download the file [login to view URL] for the framework for the Edge class. You will write the code for all the methods. The code for the constructor, setter, and getter methods are straightforward. You cannot add additional methods or any nested classes to the Edge class.
Hello
I am Java and Algorithm expert and interested in this project. I have reviewed the details and confident to handle it perfectly.
I have a lot of experience in helping in students with assignments, so I will keep codes well documented and simple. Please communicate to discuss further.
Regards
Anshu
Hello, I am experienced and specialized in C/C++ and Java programming, I have experience in Android. I have taken part in many competitions, including national competition, in which I won 2nd prize. I am currently a Computer Science student at National University of Singapore. I always work with responsibility and quality. Please contact me for details and time required, I will finish the job within time required. Thank you!
I believe that I am the best candidate for this position because of my extensive customer service and management experience and my ability to adapt to any situation. I have a passion for success and goal oriented demeanor that would push me to accomplish my set tasks. Also, with my personable character I can work well and communicate with others to contribute to team efforts. In all that I do I would strive to advance the company, and I feel that my previous work experience proves that.