Question

consider the following statements .s1. kruskal;s algorithm migth produce a non -minial spanning tree .s2. kruskal;s algorithm can efficiently implemented using the disjoint -set data structure

Answer 1

Answer:

hlo

Step-by-step explanation:

nggj.oe good ski Doo Vs one inflorescence subs Baki turns bro no UT see o Dr GNU emo unsubtle

Answer 2

From the following statement, S2 is true but S1 is false

Step-by-step explanation:

• In Kruskal’s algorithm, the disjoint-set data structure efficiently identifies the components containing a vertex and adds the new edges.
• Kruskal’s algorithm always finds the minimum spanning tree for the connected graph.
• So, S2 Kruskal's algorithm can efficiently be implemented using the disjoint-set data structure in the correct statement.