Table of Contents
Example Problem: Connectivity
Union and Find
Union/Find using Reverse Trees
An Improvement: Weighted Union
Weighted Union Lemmas
Weighted Union + Path Compression
Yes, It Helps
Ackerman’s Function
Definition for a(n)
Lower Envelope of Line Segments |
Author: Paul Chew Home Page: http://www.cs.cornell.edu/cs409-sp99/ |