#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: | 88e58625775dfa5cea13db7336dc5f5371ab3768
public/ayyer/perfect_matchings | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello !
> But since it modifies the graph in-place, I don't want to modify the
original {{{G}}} since I am running a loop over all neighbours of the
vertex {{{g}}} in {{{G}}} and calling the method recusively. I only want
to "temporarily delete" vertices within the loop.
This why the technique is to remove the vertices before calling the
subfunction, and to add them back (with their edges) right after the
subfunction call. This is a way to avoid having many copies of the whole
graph, when all you need is -- as you say -- to have a temporarily smaller
graph.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17132#comment:26>
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.
