#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):
Oh, and another 'optional' thing: many functions which return edges or
list of edges have a `labels=True/False` optional argument to tell whether
you want the edges to be pairs or triples (containing the label). This
could be done here too if you want.
{{{
sage: g = graphs.PetersenGraph()
sage: g.edges_incident(0,labels=False)
[(0, 1), (0, 4), (0, 5)]
sage: g.edges_incident(0,labels=True)
[(0, 1, None), (0, 4, None), (0, 5, None)]
}}}
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/20061#comment:7>
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.
