#20061: Add method for finding all perfect matchings to Graph
-------------------------------------+-------------------------------------
Reporter: egunawan | Owner:
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-7.1
Component: graph theory | Resolution:
Keywords: perfect matching, | Merged in:
graph | Reviewers:
Authors: | Work issues:
Report Upstream: N/A | Commit:
Branch: u/egunawan/20061 | 37e077afe84f151ef2772d8f560bc547e76f51f5
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello,
> In regards to `.matching()`, it seems like the method returns a maximum
matching that is not necessarily a perfect matching. For example,
> {{{
> sage: Graph([[1,2],[2,3]]).matching()
> [(2, 3, None)]
> }}}
> Could you comment on this?
The `.matching()` function returns a largest matching, not necessarily
perfect matching. Just test the size of the matching it returns.
Unfortunately, I decided to stop contributing to Sage a couple of hours
ago. I wish you good luck.
Regards,
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/20061#comment:16>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
