-
Notifications
You must be signed in to change notification settings - Fork 46
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
Edge-weights #3: minimum spanning trees #650
Edge-weights #3: minimum spanning trees #650
Conversation
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.
Quick comments that occur to me on quick inspection:
- there seem to be some white space only changes in these changes, might be easier to review if those were reverted or separated into a separate pr
- there's an xml entity that should be included in the doc for attributes and properties that says something to the effect of "for mutable digraphs this is recomputed every time the function is called"
- I noticed that there's a union find implementation in the pr, but this already exists in the data structures package which I think we already require, be better to use that than roll our own again.
Otherwise looks good! On my phone so excuse the brevity!
39ff2a3
to
fc19425
Compare
@james-d-mitchell: Thanks for the comments. Changed as you suggested. Failing Codespell due to an unrelated "satsifies" elsewhere in the doc. Not sure why that's only appearing here, but I don't think it's related to this PR. |
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.
Looks good
No description provided.