#17132: Perfect Matchings for Graphs
-------------------------------------+-------------------------------------
Reporter: ayyer | Owner:
Type: task | Status: new
Priority: minor | Milestone: sage-6.4
Component: graph theory | Resolution:
Keywords: perfect | Merged in: 6.3
matchings, graphs | Reviewers:
Authors: Arvind Ayyer | Work issues:
Report Upstream: N/A | Commit:
Branch: | 36fd1151164215523d7d24c6713a53deae5c3b90
public/ayyer/perfect_matchings | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by git):
* commit: 3d62f2c58fc66c4e91826b2b5e27409dcb58f651 =>
36fd1151164215523d7d24c6713a53deae5c3b90
Comment:
Branch pushed to git repo; I updated commit sha1. New commits:
||[http://git.sagemath.org/sage.git/commit/?id=36fd1151164215523d7d24c6713a53deae5c3b90
36fd115]||{{{made perfect_matchings a graph method}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/17132#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 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.
