#20061: Add method for finding all perfect matchings to Graph
-------------------------------------+-------------------------------------
Reporter: egunawan | Owner:
Type: enhancement | Status: new
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 | da6befdeec141f05f665de5e5322752c2751f2ef
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
Yo,
> Ah, right; copying an immutable graph does nothing. Emily, you need `Gp
= self.copy(immutable=False)`. Could you also add a test against immutable
graphs?
`copy(a_graph)` does what you want, though it is less explicit. Volker
insisted that `copy(something)` should always be mutable, while I insisted
that `copy(a_graph)` should not take 3Gig in memory if `a_graph` only
takes 100Mo.
Life.
> This is my fault; I had forgotten to mention this to her. How rare would
you say it is that a graph does not have a perfect matching but each
connected component has an even number of vertices?
"Depends on the graphs", but truth is that I don't know. Give it a try,
see how bad it is, and if you really don't know this can become another
optional test. Well, do the smart/responsible thing, as always.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/20061#comment:9>
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.
