-
Notifications
You must be signed in to change notification settings - Fork 22
graph-based segmentation merge #64
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
Conversation
timholy
left a comment
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.
Sorry for the delay. This is great! Just minor issues before merging.
|
This is looking good. Two small issues left to discuss:
|
|
Thanks! re: outstanding points:
|
…ture, update English in docstrings.
|
I appreciate your awareness of the issue "are these two functions really doing the same thing?" That's really important and kudos to you for noticing & caring. There's one easy solution: don't export The filename is also optional. I'd be happy to see it renamed (that might be clearest), but I'll have no reservations whatsoever if you decide to keep it the same. |
timholy
left a comment
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.
Sorry, @jsundram, I was about to hit merge and then noticed one more thing. If you're good with this you can just accept the suggestion. Once the tests run, are you OK with merging or is there anything else you want to change?
Co-authored-by: Tim Holy <tim.holy@gmail.com>
Accepted, thanks for that improvement!
I think this looks good. I have a couple of questions that might be better resolved in different PRs:
|
|
Great questions. I'm not very fresh on these things myself, but if memory serves SimpleWeightedGraph is based on sparse matrices and is indeed incredibly slow for additions/removals of edges. If the performance is limiting, I'd be very much in favor of a more performant alternative. But I confess I'm not very fresh on these things so you should take your own experience as a more reliable guide. Thanks again for a terrific PR, @jsundram! |
|
@timholy -- I was just wondering; do I also need to bump the version number and make a new release, so that people can use the new code easily? I'm not sure how releases get made... |
|
My fault, I should have made a release. I guess I might have been holding back wondering if you were wanting to tackle the first item in #64 (comment). It's not required, though; would you like me to make a release?
Not much to it:
How about this: if you're ready for a release now, submit a PR bumping the version; I'll merge it and do the rest. Or tell me to make a new release and I'll do it. (It's no trouble, it's <1min of work total.) |
|
Thanks! I'll hold off on I just submitted #65 to get the release train started. |
see conversation here: https://discourse.julialang.org/t/hierarchical-merge-on-a-region-adjacency-graph/51633/4