William, you were the reason, I was able to understand the Union-Find so well, that I was able to code it perfectly, right after your explanation, w/o looking at the source. And by the way, I am dumb xD. Thank you so much William !
i was taking the princeton D&A course on coursera and was confused af, but this video was so helpful. They didnt even explain what union find was or what its used for, i was so lost
α(n) is the inverse Ackerman function, so in theory not constant. However, it is such a slow growing function that practically speaking it may as well be constant. For α(n) to be greater than 4, n will exceed the number of subatomic particles in the universe!
Hmm.. Disjoint Sets Data Structure - Weighted Union and Collapsing Find. Disjoint sets may be used to represent nodes/vertices of non-connected and non-directed graph.
