Hi, everyone, I need help on the following project which I provided with detail instructuion and pseudo codes.
(1) Implement and test three different algorithms : Prim's, Kruskal's and Sollin's Algorithm for finding the minimum spanning tree of a graph.
(2) To test the algorithms you will randomly generate graphs with a specified edge density and make sure that the graphs are connected.
The detail insturction of the project and data file to be tested are provided below. The project must be completed using c++.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Tables that diplay the result of the random tests you did. (There should be 9 tables - one for each combination of d and n).
3) A brief description on the following:
(a) An explaination of the data structures and how they were used for Sollin's algorithm.
(b) a discussion of which of these algorithms could be used to find a minimum spanning tree for a directed graph and the changes that would be needed to handle that situation.
(c) Answers to the following questions about Sollin's algorithm:
- At least how many edges are added in the first step?
- What is the maximum number of iterations needed?
- if you know, what is the algorithm complexity?
Platform: Unix or Linux.
Programming Language: C++.