Find shortest paths 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 “Test” to the package. Import the required packages. Declare the main class. Give the “main ()” method. Get the URL from the user. Open the URL and read the string. Get the number of vertices and store it in the variable “num”. Print the number of vertices. Create an array list. Loop until End of file using “while” condition. Read the line. Split the string. Loop through the length of the triplet. Create an array and add the tokens. Trim the edges and add the edges to the array list. Create an object for the “WeightedGraph”. Print the edges by calling the function “printWeightedEdges ()”. Call the function “getShortestPath ()”. Print the total weight of the minimum spanning tree. Call the function “printPath ()”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 29, Problem 29.11PE

Program Plan Intro

Find shortest paths

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

Import the required packages.

Declare the main class.

Give the “main ()” method.

Get the URL from the user.

Open the URL and read the string.

Get the number of vertices and store it in the variable “num”.

Print the number of vertices.

Create an array list.

Loop until End of file using “while” condition.

Read the line.

Split the string.

Loop through the length of the triplet.

Create an array and add the tokens.

Trim the edges and add the edges to the array list.

Create an object for the “WeightedGraph”.

Print the edges by calling the function “printWeightedEdges ()”.

Call the function “getShortestPath ()”.

Print the total weight of the minimum spanning tree.

Call the function “printPath ()”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

JAVA PPROGRAM Write a program that prompts the user to enter a file name, then opens the file in text mode and reads names. The file contains one name on each line. The program then compares each name with the name that is at the end of the file in a symmetrical position. For example if the file contains 10 names, the name #1 is compared with name #10, name #2 is compared with name #9, and so on. If you find matches you should print the name and the line numbers where the match was found. While entering the file name, the program should allow the user to type quit to exit the program. If the file with a given name does not exist, then display a message and allow the user to re-enter the file name. The file may contain up to 100 names. You can use an array or ArrayList object of your choosing, however you can only have one array or ArrayList. Input validation: a) If the file does not exist, then you should display a message "File 'somefile.txt' is not found." and allow the…

<<Write in Java>> - Challenge 7 File encryption is the science of writing the contents of a file in a secret code. Your encryption program should work like a filter, reading the contents of one file, modifying the data into a code, and then writing the coded contents out to a second file. The second file will be a version of the first file, but written in a secret code. Although there are complex encryption techniques, you should come up with a simple one of your own. For example, you could read the first file one character at a time, and add 10 to the character code of each character before it is written to the second file. - Challenge 8 Write a program that decrypts the file produced by the program in Programming Challenge 7. The decryption program should read the contents of the coded file, restore the data to its original state, and write it to another file

Data structure: Using Java,