CSCE 350 – Data Structures and Algorithms
Summer 2008 – Project Topic 11
Prim’s Algorithm
1. Constructs a minimum spanning tree for given graph with at least 20 vertices using Prim’s
algorithm.
2. Your program should be able to output the set of edges composing a minimum spanning tree of
the given graph.
3. Your program should be able to read a file. Each line of the file contains an edge of the given
graph represented as a pair of vertices.
4. Prepare a written report that shows your results and efficiency analysis.
5. For your in-class presentation, you need to present your algorithm and its efficiency analysis.
You also need to present your results and explain whether your results are consistent with the
theoretical analysis.
General Guidelines for Programming Projects
Please follow the guidelines below carefully. You will not receive full credit unless you follow the
instructions.
Write your code in C or C++ to run on the department’s Linux lab machines.
Document your code so that it can be read and understood by another human being. Remove
any commented-out portions of your code and any debugging outputs.
Using the dropbox on the CSE department’s secure web server (https://www.cse.sc.edu/) to
submit your work:
o All source code, makefile, etc. needed to recompile your program.
o The data files you used to test the program.
o A Linux executable generated from this source code.
o A short README text file describing how to compile and run your program.
