Add method to check whether a (di)graph is geodetic #36571
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
kwankyu
reviewed
Nov 1, 2023
kwankyu
reviewed
Nov 1, 2023
|
Documentation preview for this PR (built with commit 2a623b5; changes) is ready! 🎉 |
vbraun
pushed a commit
to vbraun/sage
that referenced
this pull request
Nov 2, 2023
A (di)graph is geodetic if there exists only one shortest path between any pair of its vertices. We add a method to check this property on unweighted (di)graphs. ### 📝 Checklist - [x] The title is concise, informative, and self-explanatory. - [x] The description explains in detail what this PR is about. - [ ] 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#36571 Reported by: David Coudert Reviewer(s): David Coudert, Kwankyu Lee
|
Thank you. |
|
You may want to include your contributions on graph theory in the next release tour https://github.com/sagemath/sage/wiki/Sage-10.2-Release-Tour |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
A (di)graph is geodetic if there exists only one shortest path between any pair of its vertices. We add a method to check this property on unweighted (di)graphs.
📝 Checklist
⌛ Dependencies