Implement a minimum spanning tree for a given graph structure. You can use any of the
listed algorithms that you have read thus far. You do not have to write them yourself, you
may take them from some source, but you must reference your source.
Utilize one of the examples listed below:
You are to submit a paper written with Microsoft Word that discusses the results of your
analysis. It should include the following:
A brief introduction of the algorithm(s) that you have selected and how the
algorithm(s) compare, if any
A discussion of the critical operation that you chose to count with an explanation
of why you selected it
A Big-O analysis of the algorithm(s) used. Make sure that critical operation count
is included with this discussion.
Comprehensive Test Plan with Step-by-step instructions, limitations, and
expectation of results for user
Comprehensive Documentation containing Approach, Lessons Learned, and
Possible Improvements sub-sections
A conclusion that summarizes the important observations of your study
This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.
One of the measurements for the achieved performance is represented by the actual running time of the program. However, since the test of the Kruskal’s implementation was done (according the requirements) only on a provided graph, this timing is not very relevant compared with the situation when the tests were performed on more input graphs.
Kruskal’s algorithm considers the edges for adding to the MST by taking one by one in increasing order. The sorting can be performed in many ways by using different data structures. In this case it was preferred an easy implementation based on selection sort....