Scribd
Upload
45 views

Assignment 10 Fall PDF

This document provides instructions for CS201 Assignment #10, which requires students to implement a minimum spanning tree algorithm in Java. Students must write a program that reads an adjacency matrix representation of a graph from a file, determines if the graph is directed or undirected, finds the minimum spanning tree using the appropriate algorithm, and outputs the results. The project report must include a description of the solution, file format instructions, an explanation of the output format, and details on the data structures used.

Uploaded by

Joe Dane
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
45 views

Assignment 10 Fall PDF

This document provides instructions for CS201 Assignment #10, which requires students to implement a minimum spanning tree algorithm in Java. Students must write a program that reads an adjacency matrix representation of a graph from a file, determines if the graph is directed or undirected, finds the minimum spanning tree using the appropriate algorithm, and outputs the results. The project report must include a description of the solution, file format instructions, an explanation of the output format, and details on the data structures used.

Uploaded by

Joe Dane
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS201 Assignment #10 Implement Minimum Spanning Tree

Due Date: Thursday, October 15, 2015 at 11:59 PM


Submission Materials and Instructions: Java code & project report. Submit via eCampus.
Project Report Contents for Assignment #10:
Name
Date of Submission
Brief (1 paragraph/3-4 sentences) description of your solution and how to run your program
Explain how a file should be formatted to be read into your program (i.e., instructions to create a
file your program can read).
Explain the format of your program output (i.e., how to read the output) and it how it represents
the minimum spanning tree.
Identify, explain, and justify the choices you made for data structures used throughout the program
o Storage of the adjacency matrix
o Data structures used to implement the minimum spanning tree algorithm(s)
Any resources used (your textbook, websites, etc)
o Please make sure to credit the source of your algorithm
Any known problems, issues, errors, message to me about your assignment, etc
Objective:
To review material covered in lecture
To allow students to practise implementing data structures
To allow students to understand the difference between directed and undirected graphs
Description:
Create a Java program that has the following functionality:
1. Your program should get a graph from the user via a file. It should be provided in adjency matrix
format.
2. Determine if the graph is a directed or undirected graph.
3. Find the minimum spanning tree for the graph using the proper algorithm.
4. Output the minimum spanning tree to the user.
Solution Requirements:
Your program must get the graph from the user via a file. The format of the file is your choice as a
programmer, but it must be from a file.
For full credit, your program must work for any size graph that is either directed or undirected.
(But you may assume that the size is smaller than the maximum integer).
At the end the program must output the minimum spanning tree. The format of this output is
your choice as the programmer.
Suggestion/Hints:
You can use any markers for the graph (letters or numbers) I dont care
The file format is entirely up to you again, I dont care. But you will have to explain it in your
project report.
The output format is entirely up to you again, again, I dont care. But you will have to explain it
in your project report.
The data structures you select to use for storage thoughout the process again, again, again, I
dont care. But you will have to explain it in your project report.
Feel free to find code on the web to assist in creating your solution, but make sure you reference it
in your project report

You might also like