change the default algorithm to the faster one in {path, cycle}_enumeration #41076
Conversation
This file contains hidden or 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
|
Documentation preview for this PR (built with commit daeb424; changes) is ready! 🎉 |
|
Some doctests are failing due to these changes. |
vbraun
pushed a commit
to vbraun/sage
that referenced
this pull request
Oct 26, 2025
sagemathgh-41076: change the default algorithm to the faster one in {path, cycle}_enumeration I changed the default algorithm to the faster one (and fixed the results of several tests) in + `all_simple_cycles` in `cycle_enumeration.py` (default algorithm is changed to `'B'`) + `shortest_simple_paths` in `path_enumeration.pyx` (default algorithm is changed to `'PNC'`) + `nc_k_shortest_simple_paths` in `path_enumeration.pyx` (default parameter `postponed` is changed to `True`) I found two unimplemented features in `all_cycles_iterator` in `cycle_enumeration.py` when `algorithm='B'`. The features are the followings: + The algorithm 'B' is unavailable when `starting_vertices` is not None. + The algorithm 'B' is unavailable when `rooted=True`. I rase errors when these happen. <!-- ^ Please provide a concise and informative title. --> <!-- ^ Don't put issue numbers in the title, do this in the PR description below. --> <!-- ^ For example, instead of "Fixes sagemath#12345" use "Introduce new method to calculate 1 + 2". --> <!-- v Describe your changes below in detail. --> <!-- v Why is this change required? What problem does it solve? --> <!-- v If this PR resolves an open issue, please link to it here. For example, "Fixes sagemath#12345". --> ### 📝 Checklist <!-- Put an `x` in all the boxes that apply. --> - [x] The title is concise and informative. - [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. - [ ] I have updated the documentation and checked the documentation preview. ### ⌛ Dependencies <!-- List all open PRs that this PR logically depends on. For example, --> <!-- - sagemath#12345: short description why this is a dependency --> <!-- - sagemath#34567: ... --> URL: sagemath#41076 Reported by: Yuta Inoue Reviewer(s): David Coudert
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
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.
I changed the default algorithm to the faster one (and fixed the results of several tests) in
all_simple_cyclesincycle_enumeration.py(default algorithm is changed to'B')shortest_simple_pathsinpath_enumeration.pyx(default algorithm is changed to'PNC')nc_k_shortest_simple_pathsinpath_enumeration.pyx(default parameterpostponedis changed toTrue)I found two unimplemented features in
all_cycles_iteratorincycle_enumeration.pywhenalgorithm='B'. The features are the followings:starting_verticesis not None.rooted=True.I rase errors when these happen.
📝 Checklist
⌛ Dependencies