   Kruskal's Algoritm
  Hello,So I made this adjacency Matrix [ from graph theory ]. Now I need to implementkruskal algorithm. I have a Priority Queue, and a Set class defined already.Now I need to implement a Partition class. Specifically, its interface needs tobe as follows :public interface Partition<E> {public abstract Position<E> makeSet(E x);public abstract Set<E> union(Set<E> A, Set<E> B);public abstract Set<E> find(Position<E> p);} The book tells me that a partition is a collection of disjoint sets. So I thoughI would use DoubleLinkedList<Set<E>> _partitionSets; To hold all of the set.But I am confused on the Partition INterface, specifically, how to implementthose methods. Can anyone help me.Also, I fail to see how the Partition class would be used in the Kruskal's Algorithm. Can someone help me please.   
  What is Position<E>? Is this for a class in which you have to use a linked list represntation? Because if not you should use a disjoint-set forest with path compression. The wikipedia article is pretty good. I think what you are trying to do is use what they are calling Disjoint-set linked lists on wikipedia except using sets instead of a linked lists.   ;  Yea, thanks for the response. I talked to my friends in class and figured outwhat we have to do.   