UnionFind

public class UnionFind {

    Knoten head;
    Knoten tail;

    public UnionFind(){
        head = new Knoten(0);
        tail = new Knoten(0);
        head.vorgaenger = head;
        tail.vorgaenger = head;
    }

    public void einfuegen(int schluessel){
        Knoten k = new Knoten(schluessel);
        Knoten n = tail;

        k.vorgaenger = tail.vorgaenger;
        tail.vorgaenger = k;

        while(n.vorgaenger != head){
            n = n.vorgaenger;
        }
        k.repraesentant = n;
    }

    public void ausgabe(){
        Knoten k = tail;
        while(k.vorgaenger != head){
            k = k.vorgaenger;
            System.out.println(k.schluessel);
        }
    }

}