title |
date |
draft |
description |
tags |
categories |
series |
favorite |
disable_feed |
Union Find |
2024-06-24T21:07:49+01:00 |
false |
My favorite data structure |
algorithms |
data structures |
python |
|
|
|
false |
false |
To kickoff the [series]({{< ref "/series/cool-algorithms/">}}) of posts about
algorithms and data structures I find interesting, I will be talking about my
favorite one: the Disjoint Set. Also known as the Union-Find data
structure, so named because of its two main operations: ds.union(lhs, rhs)
and
ds.find(elem)
.