From e9e5a3bca001f1ea261303b3d5e4eb2f95cc7b8a Mon Sep 17 00:00:00 2001 From: Bruno BELANYI Date: Mon, 24 Jun 2024 23:01:48 +0100 Subject: [PATCH] posts: add union-find --- content/posts/2024-06-24-union-find/index.md | 26 ++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 content/posts/2024-06-24-union-find/index.md diff --git a/content/posts/2024-06-24-union-find/index.md b/content/posts/2024-06-24-union-find/index.md new file mode 100644 index 0000000..930fcd9 --- /dev/null +++ b/content/posts/2024-06-24-union-find/index.md @@ -0,0 +1,26 @@ +--- +title: "Union Find" +date: 2024-06-24T21:07:49+01:00 +draft: false # I don't care for draft mode, git has branches for that +description: "My favorite data structure" +tags: + - algorithms + - data structures + - python +categories: + - programming +series: + - Cool algorithms +favorite: false +disable_feed: 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_][wiki]. Also known as the _Union-Find_ data +structure, so named because of its two main operations: `ds.union(lhs, rhs)` and +`ds.find(elem)`. + +[wiki]: https://en.wikipedia.org/wiki/Disjoint-set_data_structure + +