#9698: Hamiltonian cycles in undirected graphs - backtracking algorithm.
----------------------------------+-----------------------------------------
Reporter: fidelbarrera | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.6
Component: graph theory | Keywords:
Author: Fidel Barrera-Cruz | Upstream: N/A
Reviewer: Nathann Cohen | Merged:
Work_issues: |
----------------------------------+-----------------------------------------
Changes (by ncohen):
* reviewer: => Nathann Cohen
Comment:
Then I guess this is it ! I am adding a small patch with unimportant
modifications, like adding backquotes, lists for enumerations, or changing
the length of some lines. I also added a doctest, just in case. Whatever
happens, I do not fear anything wrong from this method as it tests its
output before returning it... Positive review to your patch ! Could you
review mine ? `:-)`
Thanksssssss !!
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9698#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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
