Find a cycle Program Plan: Exercise.java: Import the required packages. Create a class “Exercise”: Define the main method Define and declare the required vertices. Define and declare the required edges. New graph gets created for the defined edges and vertices. Display the cycle that is found. Define and create the class “UnweightedGraphFindCycle” Create a new constructor. New graph gets using the constructor. Method to “cloneEdges()” gets created. New list gets created. Loop that iterates to add the edges into the list. A neighbor copy of the edges is added. Returns the result of the neighbor copy. Method “getACycle()” gets created to find the cycle. New list is created. Loop that iterates to add the elements into the list. New list that contains the neighbor node, clone edges are created. Loop that iterates to assign the value to the parent node is defined. New stack gets defined. Elements are added in to the stack. Validate the stack and add elements into the stack. Mark the nodes that are visited. Validate the elements of the stack add and remove elements based on the nodes that are visited. If the graph does not contain any cycle returns null. UnweightedGraph.java: Import the required packages. Create a class “UnweightedGraph”: New list for the vertices gets created. New list for the neighbor node gets created. Create an empty constructor. Method to create new graph gets created and adjacency list gets created. Method to create an adjacency list gets created. Method to return the size of the vertices. Method to return the index of the vertices gets defined. Method to gets the neighbor node gets defined. Method to return the degree of the vertices gets created. Method to print the Edges gets created. New to clear the graph gets created. Method to add vertex gets created. Method to add edge gets created. Method to perform the depth first search gets defined. Method to perform breadth first search gets defined. Search tree gets returned. Create a class “SearchTree” Define the method to return the root. Method to return the parent of the vertices Method to return the search order gets defined. Method to return the number of vertices found gets defined. Method to get the path of the vertices gets defined. Loop to validate the path gets defined. Path gets returned. Method to print the path gets defined. Method to print the tree gets defined. Display the edge. Display the root. Condition to validate the parent node to display the vertices gets created. Graph.java: A graph interface gets created. Method to return the size gets defined. Method to return the vertices gets defined. Method to return the index gets created. Method to get the neighbor node gets created. Method to get the degree gets created. Method to print the edges. Method to clear the node gets created. Method to add the edges, add vertex gets created. Method to remove the vertices gets defined. Method for the depth first search gets defined. Method for the breadth first search gets defined. Edge.java Create a class “Edge” Define and declare the required variables. Constructor gets defined. Method that defines Boolean objects gets defined. Return the value after validating the vertices.

Question

Want to see the full answer?

Answer 1

Question

Chapter 28, Problem 28.7PE

Program Plan Intro

Find a cycle

Program Plan:

Exercise.java:

Import the required packages.

Create a class “Exercise”:

Define the main method

Define and declare the required vertices.

Define and declare the required edges.

New graph gets created for the defined edges and vertices.

Display the cycle that is found.

Define and create the class “UnweightedGraphFindCycle”

Create a new constructor.

New graph gets using the constructor.

Method to “cloneEdges()” gets created.

New list gets created.

Loop that iterates to add the edges into the list.

A neighbor copy of the edges is added.

Returns the result of the neighbor copy.

Method “getACycle()” gets created to find the cycle.

New list is created.

Loop that iterates to add the elements into the list.

New list that contains the neighbor node, clone edges are created.

Loop that iterates to assign the value to the parent node is defined.

New stack gets defined.

Elements are added in to the stack.

Validate the stack and add elements into the stack.

Mark the nodes that are visited.

Validate the elements of the stack add and remove elements based on the nodes that are visited.

If the graph does not contain any cycle returns null.

UnweightedGraph.java:

Import the required packages.

Create a class “UnweightedGraph”:

New list for the vertices gets created.

New list for the neighbor node gets created.

Create an empty constructor.

Method to create new graph gets created and adjacency list gets created.

Method to create an adjacency list gets created.

Method to return the size of the vertices.

Method to return the index of the vertices gets defined.

Method to gets the neighbor node gets defined.

Method to return the degree of the vertices gets created.

Method to print the Edges gets created.

New to clear the graph gets created.

Method to add vertex gets created.

Method to add edge gets created.

Method to perform the depth first search gets defined.

Method to perform breadth first search gets defined.

Search tree gets returned.

Create a class “SearchTree”

Define the method to return the root.

Method to return the parent of the vertices

Method to return the search order gets defined.

Method to return the number of vertices found gets defined.

Method to get the path of the vertices gets defined.

Loop to validate the path gets defined.

Path gets returned.

Method to print the path gets defined.

Method to print the tree gets defined.

Display the edge.

Display the root.

Condition to validate the parent node to display the vertices gets created.

Graph.java:

A graph interface gets created.

Method to return the size gets defined.

Method to return the vertices gets defined.

Method to return the index gets created.

Method to get the neighbor node gets created.

Method to get the degree gets created.

Method to print the edges.

Method to clear the node gets created.

Method to add the edges, add vertex gets created.

Method to remove the vertices gets defined.

Method for the depth first search gets defined.

Method for the breadth first search gets defined.

Edge.java

Create a class “Edge”

Define and declare the required variables.

Constructor gets defined.

Method that defines Boolean objects gets defined.

Return the value after validating the vertices.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Consider the ER diagram of online sales system above. Based on the diagram answer thequestions below, 1. Mention the relationship between the Order and Customer Entities. You can use the following: 1:1, 1:M, M:1, 0:1, 1:0, M:0, 0:M 2. Which one of the 4 Entities mention in the diagram can have a recursive relationship? 3. If a new entity Order_Details is introduced, will it be a strong entity or weak entity? If it is a weak entity, then mention its type (ID or Non-ID, also Justify why)? NO AI use pencil and paper

STEP 1: The skeleton Let's start by creating a skeleton for some of the classes you will need. • Write a class called Tile. You can think of a tile as a square on the board on which the game will be played. We will come back to this class later. For the moment you can leave it empty while you work on creating classes that represents characters in the game. • Write an abstract class Fighter which has the following private fields: - A Tile field named position, representing the fighter's position in the game. A double field named health, representing the fighter's health points (HP). An int field named weaponType, representing the type of weapon the fighter is using. This value is used to rank different weapon types: higher values indicate higher weapon ranks. -An int field named attackDamage, representing the fighter's attack power. The class must also have the following public methods: 3 A constructor that takes as input a Tile indicating the position of the fighter, a double…

A company database needs to store information about employees (identified by SIN, with salary and phone as attributes), departments (identified by DID, with dname and budget as attributes), and children of employees (with name and age as attributes). Employees work in departments; each department is managed by an employee; a child must be identified uniquely by name when the parent (who is an employee; assume that only one parent works for the company) is known. We are not interested in information about a child once the parent leaves the company. Draw an ER diagram using Crows Foot notation that captures this information. Important: Must submit both ER Diagram and Relational Schema images in your solution here.