#20061: Add method for finding all perfect matchings to Graph
-------------------------------------+-------------------------------------
Reporter: egunawan | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.1
Component: graph theory | Resolution:
Keywords: perfect matching, | Merged in:
graph | Reviewers: Nathann Cohen, Travis
Authors: | Scrimshaw
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/tscrim/perfect_matchings-20061 | f448279b13a8cf559d53591451dfb6fe80e2c48d
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Old description:
> Add a method for finding all perfect matchings to `Graph` using the
> following algorithm:
> Choose a vertex v, then recurse through all edges incident to v, removing
> one edge at a time whenever an edge is added to a matching.
>
> u/tscrim/perfect_matchings-20061 based on Sage version to 7.1.beta5
New description:
Add a method for finding all perfect matchings to `Graph` using the
following algorithm:
Choose a vertex v, then recurse through all edges incident to v, removing
one edge at a time whenever an edge is added to a matching.
--
Comment (by tscrim):
The `return` is there to signify that this should result in no more
iterations. I changed it from the if/else flow you had because I think
this is easier to understand code (but that is more stylistic and
debatable).
--
Ticket URL: <http://trac.sagemath.org/ticket/20061#comment:22>
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.
