Disjoint Sets - Data Structures in 5 Minutes
Dickson Tsai — May 15, 2013 — talk
Why watch
A brief introduction to the Disjoint Set (Union-Find) data structure covering its basic operations. Created as a study aid for UC Berkeley's CS61B data structures course, accompanying Prof. Jonathan Shewchuk's lecture notes. Suitable for students reviewing fundamental algorithmic concepts.