Skip to content
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

Merged
merged 5 commits into from
Sep 16, 2023

Conversation

dcoudert
Copy link
Contributor

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

  • The title is concise, informative, and self-explanatory.
  • The description explains in detail what this PR is about.
  • I have linked a relevant issue or discussion.
  • I have created tests covering the changes.
  • I have updated the documentation accordingly.

⌛ Dependencies

@dcoudert dcoudert self-assigned this Sep 10, 2023
@dcoudert dcoudert changed the title Make min_spanning_tree robust to vertex labels Make min_spanning_tree robust to incomparable vertex labels Sep 10, 2023
@github-actions
Copy link

Documentation preview for this PR (built with commit 38969d2; changes) is ready! 🎉

Copy link
Contributor

@fchapoton fchapoton left a 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..

Copy link
Contributor

@fchapoton fchapoton left a 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

@dcoudert
Copy link
Contributor Author

Thank you.

vbraun pushed a commit to vbraun/sage that referenced this pull request Sep 14, 2023
…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
@vbraun vbraun merged commit 683b05b into sagemath:develop Sep 16, 2023
15 of 18 checks passed
@mkoeppe mkoeppe added this to the sage-10.2 milestone Sep 16, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants