🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Union-Find (Disjoint Set Union): all 10 questions

Quiz: Union-Find (Disjoint Set Union) · Question 10 of 10

In Kruskal's algorithm, what does a union that returns False tell you?

In Kruskal's algorithm, what does a union that returns False tell you?

  1. A.The edge is the lightest one
  2. B.The graph is not connected
  3. C.The MST is complete
  4. D.The edge's two ends are already connected, so taking it would create a cycle
Answer & explanation

Correct answer: The edge's two ends are already connected, so taking it would create a cycle

Kruskal skips exactly those edges.

Can you get the rest right without peeking?

Take the timed Quiz: Union-Find (Disjoint Set Union) quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →