#7477: Matroids
---------------------------------+------------------------------------------
Reporter: ncohen | Owner: jkantor
Type: enhancement | Status: new
Priority: major | Milestone: sage-wishlist
Component: combinatorics | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by Stefan):
Hi!
There's a significant effort going on behind the screens to get matroids
into Sage. You can get to our work-in-progress code at
https://bitbucket.org/matroid/sage_matroids/
and we've got a mailing list at
https://groups.google.com/group/sage-matroid
Please join in the discussion. There is still plenty to be done.
A quick description of our current status: we've got an abstract Matroid
class with a bunch of subclasses: BasisMatroid, LinearMatroid,
RankMatroid, CircuitClosuresMatroid are the main ones. There is support
for minors and abstract duality. We have a rather fast isomorphism test,
and a host of methods for standard queries. There's also a library of
common matroids, and a constructor that takes various inputs (including
Sage graphs). So you can write
M = Matroid(G)
We think we need some minor coding and major documentation-string-writing
before we want to submit it to Sage.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7477#comment:12>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
