#18624: Implement the lift theorem for linear matroids
-------------------------------------+-------------------------------------
Reporter: Rudi | Owner: Rudi
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.8
Component: matroid theory | Resolution:
Keywords: | Merged in:
Authors: Rudi Pendavingh | Reviewers: Michael Welsh
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/Rudi/implement_the_lift_theorem_for_linear_matroids|
d46d8e36f5fcb534ff4e695087749a508d9f33ab
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by Rudi):
* status: positive_review => needs_work
Comment:
Sorry Michael, but I just stumbled across the fact that there will be
instances that this code cannot handle, due to the fact that
min_spanning_tree() does not work on disconnected graphs. I had assumed it
would just return a spanning forest.
So I need to repair that. It will not take long. I will ask for another
review in a minute.
--
Ticket URL: <http://trac.sagemath.org/ticket/18624#comment:40>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
