Induced subgraph Program Plan: Create a package “main”. Add a java class named “Edge” to the package which is used to get the edges from the graph. Add a java class named “Graph” to the package which is used to add and remove vertices, edges. Add a java class named “UnweightedGraph” to the package which is used to store vertices and neighbors. Add a java class named “WeightedGraph” to the package which is used to get the weighted edges and print the edges. Add a java class named “WeightedEdge” to the package which is used to compare edges. Add a java class named “E16” to the package. Import the required packages. Declare the main class. Give the “main ()” method. Declare the string array that contains the names of the city. Declare an integer array that contains the weight. Create an object for unweighted graph. Print the size of the graph, vertex of the graph, index of the vertex “Miami”, and the edges of the graph. Call the function “maxInducedSubgraph ()”. Print the size of the graph, vertex of the graph, index of the vertex “Miami”, and the edges of the graph. Give function definition for “maxInducedSubgraph ()”. Declare required variables Do until the condition “(!Isdone && g.getSize() > 0)” fails. Assign “true” to the variable. Loop from 0 through size. Check the condition “(g.getDegree(i) < k)”. Call the function “remove_Vertex ()”. Assign false to the variable. Break the loop. Return the graph. Function definition for “UnweightedGraphInducedSubgraph ()”. Construct the empty graph. Construct a graph from vertices and edges stored in arrays. Get the vertices and edges. Construct a graph from vertices and edges stored in List. Get the vertices and edges. Construct a graph for integer vertices 0, 1, 2 and edge list. Get the vertices and edges. Construct a graph from integer vertices 0, 1, and edge array. Get the vertices and edges. Give function definition for “remove_Vertex ()”. Check the condition “(vertices.contains(v))”. Get the index. Call the functions “vertices.remove ()”, and “neighbors.remove ()”. Loop to remove the edges. Loop from 0 through size. Check the condition “(list.get(i).v == index)”. If it is true then remove the edge. Else, increment the variable Loop to reassign the labels. Loop from 0 through size. Check the condition “(list.get(i).u >= index)”. If the condition is true then get the edge Check the condtion “(list.get(i).v >= index)”. If the condition is true then get the edge Return “true”. Else, Return “false”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 28, Problem 28.16PE

Program Plan Intro

Induced subgraph

Program Plan:

Create a package “main”.

Add a java class named “Edge” to the package which is used to get the edges from the graph.

Add a java class named “Graph” to the package which is used to add and remove vertices, edges.

Add a java class named “UnweightedGraph” to the package which is used to store vertices and neighbors.

Add a java class named “WeightedGraph” to the package which is used to get the weighted edges and print the edges.

Add a java class named “WeightedEdge” to the package which is used to compare edges.

Add a java class named “E16” to the package.

Import the required packages.

Declare the main class.

Give the “main ()” method.

Declare the string array that contains the names of the city.

Declare an integer array that contains the weight.

Create an object for unweighted graph.

Print the size of the graph, vertex of the graph, index of the vertex “Miami”, and the edges of the graph.

Call the function “maxInducedSubgraph ()”.

Print the size of the graph, vertex of the graph, index of the vertex “Miami”, and the edges of the graph.

Give function definition for “maxInducedSubgraph ()”.

Declare required variables

Do until the condition “(!Isdone && g.getSize() > 0)” fails.

Assign “true” to the variable.

Loop from 0 through size.

Check the condition “(g.getDegree(i) < k)”.

Call the function “remove_Vertex ()”.

Assign false to the variable.

Break the loop.

Return the graph.

Function definition for “UnweightedGraphInducedSubgraph ()”.

Construct the empty graph.

Construct a graph from vertices and edges stored in arrays.

Get the vertices and edges.

Construct a graph from vertices and edges stored in List.

Get the vertices and edges.

Construct a graph for integer vertices 0, 1, 2 and edge list.

Get the vertices and edges.

Construct a graph from integer vertices 0, 1, and edge array.

Get the vertices and edges.

Give function definition for “remove_Vertex ()”.

Check the condition “(vertices.contains(v))”.

Get the index.

Call the functions “vertices.remove ()”, and “neighbors.remove ()”.

Loop to remove the edges.

Loop from 0 through size.

Check the condition “(list.get(i).v == index)”. If it is true then remove the edge.

Else, increment the variable

Loop to reassign the labels.

Loop from 0 through size.

Check the condition “(list.get(i).u >= index)”. If the condition is true then get the edge

Check the condtion “(list.get(i).v >= index)”. If the condition is true then get the edge

Return “true”.

Else,

Return “false”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Objective: 1. Implement a custom Vector class in C++ that manages dynamic memory efficiently. 2. Demonstrate an understanding of the Big Five by managing deep copies, move semantics, and resource cleanup. 3. Explore the performance trade-offs between heap and stack allocation. Task Description: Part 1: Custom Vector Implementation 1. Create a Vector class that manages a dynamically allocated array. 。 Member Variables: ° T✶ data; // Dynamically allocated array for storage. std::size_t size; // Number of elements currently in the vector. std::size_t capacity; // Maximum number of elements before reallocation is required. 2. Implement the following core member functions: Default Constructor: Initialize an empty vector with no allocated storage. 。 Destructor: Free any dynamically allocated memory. 。 Copy Constructor: Perform a deep copy of the data array. 。 Copy Assignment Operator: Free existing resources and perform a deep copy. Move Constructor: Transfer ownership of the data array…

2.68♦♦ Write code for a function with the following prototype: * Mask with least signficant n bits set to 1 * Examples: n = 6 -> 0x3F, n = 17-> 0x1FFFF * Assume 1 <= n <= w int lower_one_mask (int n); Your function should follow the bit-level integer coding rules Be careful of the case n = W.

Hi-Volt Components You are the IT manager at Hi-Voltage Components, a medium-sized firm that makes specialized circuit boards. Hi-Voltage's largest customer, Green Industries, recently installed a computerized purchasing sys- tem. If Hi-Voltage connects to the purchasing system, Green Industries will be able to submit purchase orders electronically. Although Hi-Voltage has a computerized accounting system, that system is not capable of handling EDI. Tasks 1. What options does Hi-Voltage have for developing a system to connect with Green Industries' pur- chasing system? 2. What terms or concepts describe the proposed computer-to-computer relationship between Hi-Voltage and Green Industries? why not? 3. Would Hi-Voltage's proposed new system be a transaction processing system? Why or 4. Before Hi-Voltage makes a final decision, should the company consider an ERP system? Why or why not?