Question

Do kruskal's and prim generate different minimum spanning trees

Answer 1

Answer:

Both Prim's algorithm and Kruskal's algorithm are greedy algorithmsfor finding the Minimum Spanning Tree. For Prim's algorithm, the graph has to be connected, but that is not true in the case of Kruskal's algorithm. In Prim's algorithm, the next edge in the MST shall be the cheapest edge in the current vertex.

❤✌#⃣❤✌#⃣❤✌✌

Answer 2

Answer:

ryeuiwiwuegeteyeuiw9wieueuththrheysyaw