1. Given a Vertex object x, give Java code to enumerate its outgoing edges. ("Enumerate" means "tolist"; your code does not need to do anything with the edges, but should be setup code that wouldmake it easy to do something with each edge if we wanted to add that in.)2. Given a VertexAndDist object x and a new distance d, give Java code to create an updated objectwith the same vertex as x but with distance d.3. For simplicity of implementation, we use HashMaps to map vertices to handles/parents and edges toweights. How could you modify the Vertex and/or Edge classes, as well as the maps themselves, toimplement the maps using ordinary arrays, with no hashing? Be sure to address both the vertex andedge mapsin your answer. (Hint: consider the Vertex's "id" field for inspiration.)

“Since you have asked multiple questions, we will solve the first question for you. If you want any…

1. Given a Vertex object x, give Java code to enumerate its outgoing edges. ("Enumerate" means "to list"; your code does not need to do anything with the edges, but should be setup code that would make it easy to do something with each edge if we wanted to add that in.)

1. Given a Vertex object x, give Java code to enumerate its outgoing edges. ("Enumerate" means "to list"; your code does not need to do anything with the edges, but should be setup code that would make it easy to do something with each edge if we wanted to add that in.)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write Java code for the following: a. Create an Arraylist that can hold Integer objects. b. Check and display whether the Arraylist is empty or not. C. Add an element 50 into the Arraylist. d. Add another element 60 in the position of 0 in the Arraylist. e. Replace the element to 70 in index 1.
The purpose of this project is to assess your ability to (JAVA): Implement a graph abstract data type. The getDistance method should print the distance of all connected nodes/ vertices. A graph is a set of vertices and a set of edges. Represent the vertices in your graph with an array of strings: Represent the edges in your graph as a two-dimensional array of integers. Use the distances shown in the graph pictured here.Add the following functions to your graph class: A getDistance function that takes two vertices and returns the length of the edge between them. If the vertices are not connected, the function should return the max value for an integer. A getNeighbors function that takes a single vertex and returns a list of all the vertices connected to that vertex. A print method that outputs an adjacency matrix for your graph. Write a test program for your Graph class.
Write Java code for the following: Create an Arraylist that can hold Integer objects. Check and display whether the Arraylist is empty or not. Add an element 50 into the Arraylist. Add another element 60 in the position of 0 in the Arraylist. Replace the element to 70 in index 1.
Java In this assignment, you will practice using an ArrayList. Your class will support a sample program that demonstrates some of the kinds of operations a windowing system must perform. Instead of windows, you will be manipulating “tiles.” A tile consists of a position (specified by the upper-left corner x and y), a width, a height, and color. Positions and distances are specified in terms of pixels, with the upper-left corner being (0, 0) and the x and y coordinate increasing as you move left and down, respectively. You won’t have to understand a lot about tiles and coordinates. That code has been written for you. You are writing a small part of the overall system that keeps track of the list of tiles. You are required to implement this using an ArrayList. The only method you need to use from the Tile class is the following: // returns true if the given (x, y) point falls inside this tile public boolean inside(int x, int y) Your class is to be called TileList and must…
Design and implement an insertSorted() method for the MyArrayList class. The method should receive a single object and insert it in its correct position. You can assume that the calling array is already in a sorted order. The calling array is therefore updated. Follow the three step method for designing the method. Develop the java code for the method. Create a test program to test the method thoroughly using the Integer wrapper class.
Write a java while loop that loops through an array of type int with a size of 6, and adds up every other element in the array and prints the sum.
Please use java. Show the steps with pictures. In this assignment, you will implement a class calledArrayAndArrayList. This class includes some interesting methods for working with Arrays and ArrayLists. For example, the ArrayAndArrayList class has a “findMax” method which finds and returns the max number in a given array. For a defined array: int[] array = {1, 3, 5, 7, 9}, calling findMax(array) will return 9. There are 4 methods that need to be implemented in the A rrayAndArrayList class: ● howMany(int[] array, int element) - Counts the number of occurrences of the given element in the given array. ● findMax(int[] array) - Finds the max number in the given array. ● maxArray(int[] array) - Keeps track of every occurrence of the max number in the given array. ● swapZero(int[] array) - Puts all of the zeros in the given array, at the end of the given array. Each method has been defined for you, but without the code. See the javadoc for each method for instructions on what the…
I have an ArrayList and I want to sort it by increasing string length. The ArrayList class has a method sort(Comparator comp). Give a class that implements the Comparator interface that I can use to sort my ArrayList.
Create the following graph. Implement the following functions. 1. addEdge() that takes two vertices as two parameters and creates an Edge between them. 2. nonAdjacentVertices() that takes a single vertex as parameter, and returns an array of vertices that are NOT adjacent to that vertex. 3. Write a function addUnknownVertices() that takes a vertex as a parameters, and creates an Edge with the vertices that are NOT adjacent to it. 4. Write a method searchVertex() which takes an array of Vertices as parameters. The first member of the array will be the starting vertex and the last member will be the Vertex you want to reach. For example searchVertex(Vertex 0, Vertex 4, Vertex 3) will output “Vertex cannot be reached” since you can reach from 0 to 4, but cannot from 4 to 3. Again, searchVertex(Vertex 0, Vertex 1, Vertex 2, Node 3) will output “Vertex can be reached” since you can reach from 0 to 1, 1 to 2, 2 to 3.
IN JAVA (Find paths)Define a new class named UnweightedGraphWithGetPath that extends UnweightedGraph with a new method for finding a path between two vertices with the following header:public List getPath(int u, int v);The method returns a List that contains all the vertices in a path from u to v in this order. Using the BFS approach, you can obtain the shortest path from u to v. If there isn’t a path from u to v, the method returns null. Write a test program that creates a graph for Figure 28.1. The program prompts the user to enter two cities and displays their paths. Sample RunEnter a starting city: SeattleEnter an ending city: MiamiThe path is Seattle Denver Kansas City Atlanta Miami Use https://liangpy.pearsoncmg.com/test/Exercise28_05.txt to test your code.
The purpose of this project is to assess your ability to: · Implement a graph abstract data type. A graph is a set of vertices and a set of edges. Represent the vertices in your graph with an array of strings:  Represent the edges in your graph as a two-dimensional array of integers. Use the distances shown in the graph pictured here.  Add the following functions to your graph class: · A getDistance function that takes two vertices and returns the length of the edge between them. If the vertices are not connected, the function should return the max value for an integer. · A getNeighbors function that takes a single vertex and returns a list of all the vertices connected to that vertex. · A print method that outputs an adjacency matrix for your graph. Write a test program for your Graph class in JAVA.
Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. Use the following files: Question.java /** A question with a text and an answer.*/public class Question{ private String text; private String answer; /** Constructs a question with empty text and empty answer. */ public Question() { text = ""; answer = ""; } /** Sets the answer for this question. @param correctResponse the answer */ public void setAnswer(String correctResponse) { answer = correctResponse; } /** Checks a given response for correctness. @param response the response to check @return true if the response was correct, false otherwise */ public boolean checkAnswer(String response) { return response.equals(answer); } /** Add a line of text to…