#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:
matchings, graphs | Reviewers:
Authors: Arvind Ayyer | Work issues:
Report Upstream: N/A | Commit:
Branch: | 6091b96904f172d6aea9e4926cb14257850c77ea
public/ayyer/perfect_matchings | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello !
> Now the question is (perhaps for Nathan): should that be a separate post
on the trac/patch ?
It can be the same if you think that this patch will quickly be finished
and reviewed, it can be an independent one otherwise. You are free to do
whatever you like here !
> I have another question : for the moment, you return perfect matchings
as a list of pairs. Mathematically, I think it is more logical to treat it
as a set of sets (two perfect matchings which differ by a permutations of
the pairs are equal). But perhaps turning it into a set in sage would
imply unnecessary copies/tests, so I wonder what is the best choice...
Well, edges of a graph are pairs at the moment, so it would not be
inconsistent with what we already do. I also prefer simple data
structures, but several can be available if you like.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17132#comment:17>
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.
