#20061: Add method for finding all perfect matchings to Graph
-----------------------------+-------------------------------------------
Reporter: egunawan | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-7.1
Component: PLEASE CHANGE | Keywords: perfect matching, graph
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+-------------------------------------------
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.
code in progress
--
Ticket URL: <http://trac.sagemath.org/ticket/20061>
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.
