View the step-by-step solution to:

# A java program that reads a connected weighted graph from a user.

A java program that reads a connected weighted graph from a user. Then the program will prompt the user to enter the name of two vertices, check if they exist and if so, the program will display the shortest path between these two vertices and the weight from going from one vertex to the other.(using any data structure)

Test program on the following:

Vertex 0: (0,1, 5) (0,2, 29)

Vertex 1: (1,0, 30) (1,3, 12)

Vertex 2: (2, 0, 32) (2,3, 22) (2,4, 7)

Vertex 3: (3, 1, 15) (3,2, 8) (3, 4, 22) (3, 5, 10)

Vertex 4: (4,2, 7) (4,3, 6) (4,5, 12)

Vertex 5: (5,3, 2) (5,4, 100)

what is the path between 0 and 5?

What is the weight of the path between 0 and 5?

Output: Enter the number of vertices: 6 Enter the number of edges: 16 Enter the edges and weight: 0 1 6... View the full answer

FLim
Enter the number of vertices
Enter the number of edges
IF
Enter the edges and weight
1 E
29
10 30
1 2 45
2 0 32
5 0
A
3 1 15
3 2 8
3 4 2 2
2 5 ID
1 3
\$ 3 6
4 5 1
De
5 4 190
Enter two vertices...

1 comment
• • The main method takes a user input of vertices, edges, weights, and their number. • Method 'addEdge()' add the edges in the graph to produce an adjacency matrix • Method 'Dijkstra()' calculates the shortest path from the source to all vertices in the graph. • Method 'printSolution()' print only the results of destination vertex from all others. It shows the minimum weight from source to destination. • Method 'printPath()' prints the path used for minimum weight.
• raksha_nawal
• Dec 06, 2018 at 4:25am

### Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

### -

Educational Resources
• ### -

Study Documents

Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

Browse Documents