-
Notifications
You must be signed in to change notification settings - Fork 21
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add unify
keyword and default if to true
#64
base: master
Are you sure you want to change the base?
Add unify
keyword and default if to true
#64
Conversation
Still to add tests and discuss the proper algorithm to unify boxes. |
Out of curiosity, do you know how much computational overhead this introduces? Just wondering which one would be a better default value. Here a simple MWE that might be good for benchmarking
this example should return 2990 minimisers, so it might be a good small but not too small example for benchmarking |
Ah, you answered my questions while I was writing that 😄 Amazing! sorry for the noise |
Don't worry, happy to help. :D |
At a first glance this looks great, thanks! Could you please add some tests? |
Sure, I'll add test. I just want to know what do you think about the "problem" of using union-find that I described in the comment in the original issue. |
return disjoint_sets[i] | ||
end | ||
|
||
function add_set!(disjoint_sets, weights_sets, i, j) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What is weights_sets
for?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Is an optimizations for union-find to make the union and find operations almost constant.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This is the fastest asymtotically variant known of union-find. The algorithm is described here.
fix #48