#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: | 3d62f2c58fc66c4e91826b2b5e27409dcb58f651
public/ayyer/perfect_matchings | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by ayyer):
> A method which enumerates the perfect matchings of a graph is a graph
method.
Okay, I can move this method to {{{graph.py}}} eventually.
> Do you mean {{{g.perfect_matching}}}? If so, that would only work if
{{{perfect_matching}}} is a graph method.
But I thought that since it is the ''graphs'' directory, it automatically
becomes a graph method. How do I force it to be a graph method? Thanks.
Arvind
--
Ticket URL: <http://trac.sagemath.org/ticket/17132#comment:7>
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.