lazyweb, is there an algorithm that's like the inverse of union-find? I want a function from a set of partially intersecting sets to a set of disjoint unions, is there a better way to implement it than the naive one?
-
Show this thread
Replying to @whitequark
Not quite sure what you mean, but it sounds like you might want interval trees?
3:52 PM - 15 Jul 2019
0 replies
0 retweets
2 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.