WEIGHTEDQUICKUNION

*** I implemented a weighted quick union algorithm; however, I'll like to be able to show how the nodes (or pairs) connect to one another in a tree representation, or another way that shows that the algorithm actually works by showing it on the console application. ***

* Reads in a sequence of pairs of integers (between 0 and N-1) from * standard input, where each integer represents some object; if the objects * are in different components, merge the two components and print the pair * to standard output. public static void main(String[] args) { int N = Stdin.readInt(); WeightedQuickUnionUF uf = new WeightedQuickUnionUF (N); while (!StdIn.isEmpty()) { int p = stdin.readint(); int q = stdin.readInt(); if (uf.connected (p, q)) { continue; uf.union (p, q); Stdout.println(p + " " + q); Stdout.println(uf.count() + " components")