-
-
Notifications
You must be signed in to change notification settings - Fork 482
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
Make min_spanning_tree
robust to incomparable vertex labels
#36232
Make min_spanning_tree
robust to incomparable vertex labels
#36232
Conversation
min_spanning_tree
robust to vertex labelsmin_spanning_tree
robust to incomparable vertex labels
Documentation preview for this PR (built with commit 38969d2; changes) is ready! 🎉 |
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.
ok, but the CI is currently broken..
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.
tests pass for me in graphs, matroids, topology, so ok
Thank you. |
…tex labels Part of sagemath#35902. ### 📚 Description We ensure that method `min_spanning_tree` operates properly even when vertices and edges are of incomparable types. We are then able to simplify some code in `src/sage/topology/simplicial_complex.py`. ### 📝 Checklist <!-- Put an `x` in all the boxes that apply. --> <!-- If your change requires a documentation PR, please link it appropriately --> <!-- If you're unsure about any of these, don't hesitate to ask. We're here to help! --> <!-- Feel free to remove irrelevant items. --> - [x] The title is concise, informative, and self-explanatory. - [x] The description explains in detail what this PR is about. - [x] I have linked a relevant issue or discussion. - [x] I have created tests covering the changes. - [x] I have updated the documentation accordingly. ### ⌛ Dependencies <!-- List all open PRs that this PR logically depends on - sagemath#12345: short description why this is a dependency - sagemath#34567: ... --> <!-- If you're unsure about any of these, don't hesitate to ask. We're here to help! --> URL: sagemath#36232 Reported by: David Coudert Reviewer(s): Frédéric Chapoton
Part of #35902.
📚 Description
We ensure that method
min_spanning_tree
operates properly even when vertices and edges are of incomparable types.We are then able to simplify some code in
src/sage/topology/simplicial_complex.py
.📝 Checklist
⌛ Dependencies