Display weighted graphs 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 name “Displayable” to the package. Declare the functions “get_X ()”, “get_Y ()”, “get_Name ()”. Add a java class named “E12” to the package. Declare the cities. Declare an integer array. Create an object for the weighted graph. Create a graphview pane. Declare “start ()” method that overrides the “start ()” method in the “Application” class. Create a scene and place it on the stage. Display the stage. Declare the class “GraphView”. The “Graph” class extends the interface “Displayable”. Give the constructor for this class. Set the graph and call the function “paint ()”. Give function definition for “paint ()”. Declare a list that extends Displayable. Loop from 0 through size. Get the vertices. Get the name of the city. Add the circle, text and vertices to the pane. Loop from 0 through graph size. Create a list. Loop from 0 through neighbor’s size. Get the vertices. Inside the “try” block, Add the line, text and vertices to the pane. Inside the “catch” block, Throw the exception. Declare a class named “Cities”. Declare required variables. Give the constructor for this class which sets the name of the city, and the vertices. Get and return the co-ordinate of the vertex “x”. Get and return the co-ordinate of the vertex “y”. Get and return the name of the city. Declare function to compare cities. Return the value. Give the “main ()” method. Launch the application.

Question

Want to see the full answer?

Answer 1

Question

Chapter 29, Problem 29.12PE

Program Plan Intro

Display weighted graphs

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 name “Displayable” to the package.

Declare the functions “get_X ()”, “get_Y ()”, “get_Name ()”.

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

Declare the cities.

Declare an integer array.

Create an object for the weighted graph.

Create a graphview pane.

Declare “start ()” method that overrides the “start ()” method in the “Application” class.

Create a scene and place it on the stage.

Display the stage.

Declare the class “GraphView”.

The “Graph” class extends the interface “Displayable”.

Give the constructor for this class.

Set the graph and call the function “paint ()”.

Give function definition for “paint ()”.

Declare a list that extends Displayable.

Loop from 0 through size.

Get the vertices.

Get the name of the city.

Add the circle, text and vertices to the pane.

Loop from 0 through graph size.

Create a list.

Loop from 0 through neighbor’s size.

Get the vertices.

Inside the “try” block,

Add the line, text and vertices to the pane.

Inside the “catch” block,

Throw the exception.

Declare a class named “Cities”.

Declare required variables.

Give the constructor for this class which sets the name of the city, and the vertices.

Get and return the co-ordinate of the vertex “x”.

Get and return the co-ordinate of the vertex “y”.

Get and return the name of the city.

Declare function to compare cities.

Return the value.

Give the “main ()” method.

Launch the application.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

MGMT SS STATS, an umbrella body that facilitates and serves various Social SecurityOrganizations/Departments within the Caribbean territories, stoodpoised to meet the needs of its stakeholders by launching an onlinedatabase at www.SSDCI.gov. The database will provide membersand the public access to the complete set of services that can (also)be initiated face-to-face, and it will provide managed, private, secure access to a repository ofpublic and/or personal information. Ideally, the database will have basic details of pensionplans recorded in the registry, member plan statistics, and cash inflows and outflows frompension funds.For example, insured persons accumulate contributions. Records for these persons will includeinformation on the insured persons able to acquire various benefits once work is interrupteddue to sickness, death, retirement, and maternity or employment injury. They will also includeinformation on pensions such as invalidity, disability, and survivors that stem from…

(c) Consider the following set of processes: Process ID Arrival Time Priority Burst Time A 2 3 100 B 6 C 10 1 (highest) 2 40 80 D 16 4 (lowest) 20

(3c) In the following resource allocation graph, is the state a deadlocked one? If so which ones are deadlocked? (3 points) Resource allocation graph. R₁ = Resource, P = process. R1 R3 R3 7