1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. Kruskal’s algorithm can efficiently impl...

Kruskal’s algorithm can efficiently implemented using the disjoint-set data structure.

A. s1 is true but s2 is false
B. both s1 and s2 are false
C. both s1 and s2 are true
D. s2 is true but s1 is false
Answer» D. s2 is true but s1 is false
Explanation: in kruskal’s algorithm, the disjoint-set data structure efficiently identifies the components containing a vertex and adds the new edges. and kruskal’s algorithm always finds the mst for the connected graph.