Minimum Spanning Trees
1. Is Prim's algorithm always better than Kruskal's algorithm?
2. Let N be any integer greater than 1. What is the minimum and maximum number of MST's possible for a given connected undirected non cyclic graph?
3. Using Kruskal’s algorithm in a non cyclic graph, what is the minimum number of iterations required to produce a MST?(Let V be the number of vertices, E be the number of edges)
4. The two algorithms: Kruskal’s and Prim’s always produce a unique MST.