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
spanning_trees does not enumerate spanning trees with edge labels #27557
Comments
Commit: |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:3
I have modified the code to include labels and tested on a few examples. |
comment:4
You should add parameter |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:6
added labels=False option |
comment:7
2 remarks:
- return _recursive_spanning_trees(Graph(self, immutable=False, loops=False), forest, labels=labels)
+ return _recursive_spanning_trees(Graph(self, immutable=False, loops=False), forest, labels) It would be nice to also get |
comment:8
Yes I have opened another ticket in which spanning_tree_iterator needs to be implemented in increasing order of weights. ticket:27532 Hope that gets implemented soon. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:10
LGTM |
Changed branch from u/gh-rajat1433/27557_spanning_trees to |
Currently spanning_trees() method does not enumerate spanning trees with their labels , it makes their labels None. This tickets aims to return the correct labels of the edges.
CC: @dcoudert
Component: graph theory
Keywords: enumeration, spanning_trees
Author: Rajat Mittal
Branch/Commit:
957df83
Reviewer: David Coudert
Issue created by migration from https://trac.sagemath.org/ticket/27557
The text was updated successfully, but these errors were encountered: