Skip to content
Global sound
Connected Components of Chaos

Connected Components of Chaos

Disjoint Sets: Data Structures and Algorithms

· 12 min · Season 1 Episode 10

Show notes

We discuss disjoint sets, also known as union-find data structures. Disjoint sets maintain collections of elements partitioned into non-overlapping sets, each with a representative element. Key operations include Make-Set (creating a new set), Find-Set (locating a set's representative), and Union (merging two sets). Different representations are explored, such as arrays, linked lists, and inverted trees, along with their associated time complexities. Heuristics like weighted union and union by rank are introduced to improve efficiency, and path compression is discussed as a way to optimize…

Website: spreaker.com

Live, last hour: 8,110 songs on 4,507 stations in 131 countries

Discover the world through radio

More ways to discover (9)

Heard something good? Save it, or open it straight away in Spotify.

Alpha Delta 1359Continue listening