this post was submitted on 03 Nov 2024
10 points (100.0% liked)

Haskell

467 readers
6 users here now

founded 2 years ago
MODERATORS
top 4 comments
sorted by: hot top controversial new old
[–] Noughtmare 1 points 1 month ago (1 children)

One thing I'm missing is which problems this technique can solve. I believe one important use case is in type inference. Are there many other problems that can be solved by union-find?

[–] [email protected] 2 points 1 month ago (1 children)

The Wikipedia article discusses some applications. One amazing thing I remembered about the algorithm is its running time, which is infinitesimally slower than linear, by which I mean that the growth factor above linear is the inverse Ackermann function! I've never studied the analysis but I found the result to be mind boggling.

https://en.wikipedia.org/wiki/Disjoint-set_data_structure

[–] Noughtmare 1 points 1 month ago

Thanks, I did look at the Wikipedia page, but the Applications section is pretty difficult to read. The applications it lists are themselves quite abstract problems.

[–] Noughtmare 1 points 1 month ago

Also, I think the 'find' operation could be replaced by an operation that checks if two elements are in the same set. That way you don't have to come up with a "name".