7
$\begingroup$

I know that the disjoint set datastructure is used to keep track of the connected components of an undirected graph when the edges are added to the graph dynamically . I also know that is is used in Kruskal's algorithm for minimum spanning trees . What are the other possible applications of this datastructure ?

$\endgroup$

1 Answer 1

7
$\begingroup$
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.