http://ubuntuforums.org – Hi. Can anyone comment on my code for a disjoint set data structure to implement union-find? As far as I'm aware, I got the basics down (with collapsing and weighting rules) but I'd like to see if there are further optimizations I can implement (or, if maybe, I'm mistaken that I got the basics down). I've run it with a few tests and I get the results I'm expecting, in any case. Thanks! Code: import java.util.Vector; /** * Disjoint Set is basically a forest data structure used to implement the * union-find algorithm. */ public class DisjointSet<Sattelite> (Hardware)