Student Name: __________________
Class and Section __________________
Total Points (20 pts) __________________
Due: Nov 28, 2018 before the class
Project: Finding a MST
CSCI 3230 Data Structures
Georgia Southern University
Problem Description:
*29.9 (Find a minimum spanning tree) Write a program that reads a connected graph from a file and
displays its minimum spanning tree. The first line in the file contains a number that indicates the
Figure 29.16
The vertices and edges of a weighted graph can be stored in a file.
Your program should prompt the user to enter a URL for the file, read data from the file, create
an instance g of WeightedGraph, invoke g.printWeightedEdges() to display all edges,
2
<output>
icon>
The number of vertices is 6
Vertex 0: (0, 2, 3) (0, 1, 100)
Vertex 1: (1, 3, 20) (1, 0, 100)
Paste your code here: You need to paste your main class only.
3
What to submit?
1. Compile and Submit to LiveLab (you must submit the program regardless whether it
complete or incomplete, correct or incorrect)
2. Email this document.