Posted by Jason Burkert on July 25, 1999 at 17:17:00:
I'm working on HW9, and I followed the process shown on p.174 and got a tree and an array, but I realized that doesn't include any "path compression". On p.176 the figure shows an example of path compression used on a single equivalence. My question is this: Is the path compression applied in every equivalence, and if so, don't you simply end up with a tree with a depth of 2 with a root and 15 children? Or is path compression applied only at the end, after all the equivalences are processed?