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

Union-Find: Maze Write a program that generates mazes of arbitrary size using the union-find algorithm. A simple algorithm to generate the maze is to start by creating an N x M grid of cells separated by walls on all sides, except for entrance and exit. Then continually choose a wall randomly, and knock it down if the cells are not already connected to each other. If we repeat the process until the starting and ending cells are connected, we have a maze. It is better to continue knocking down the walls until every cell is reachable from every cell as this would generate more false leads in the maze. Test you algorithm by creating a 15 x 15 grid, and print all the walls that have been knocked down. D

2). Write a program to implement the following graph representations and display them. i. Adjacency list ii. Adjacency matrix

C++ A program applying the topics involved in data structures (linked list, graph, array etc.) 1. User will be asked to login/signup 2. User will choose for the nearest restaurant (undirected graph?) 3. User will add to cart (from the menu list of the restaurant) 4. User will be asked for order confirmation and mode of payment (cash on delivery, card??) note: new users will have a discount 5. Invoice Using Dev c++