#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 ayyer):
Replying to [comment:15 jdemeyer]:
> You should respect
[http://www.sagemath.org/doc/developer/coding_basics.html#headings-of-
sage-library-code-files] and
[http://www.sagemath.org/doc/developer/coding_basics.html#documentation-
strings]
Thanks for the links. As I explained in the ticket, I am a new contributor
to Sage. I am happy to respect everyone and everything, but I am not quite
clear on what the objection is. Since I cut-pasted this from an existing
file, I assumed that I am following the proper protocols. Could you
explain what I need to do in more precise terms?
If you mean that I need to add examples, I will certainly do that once I
have more methods. Please note that the file is at a very rudimentary
stage at this moment.
--
Ticket URL: <http://trac.sagemath.org/ticket/17132#comment:18>
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.
