#9698: Hamiltonian cycles in undirected graphs - backtracking algorithm.
-------------------------------+--------------------------------------------
Reporter: fidelbarrera | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.6.1
Component: graph theory | Resolution: fixed
Keywords: | Author: Fidel Barrera-Cruz
Upstream: N/A | Reviewer: Nathann Cohen
Merged: sage-4.6.1.alpha0 | Work_issues:
-------------------------------+--------------------------------------------
Changes (by eviatarbach):
* status: closed => needs_work
Comment:
Great patch! I was hoping for these functions. There are some spelling
problems, though (these are all in the docstrings):
1. All instances of "hamiltonian" should be changed to "Hamiltonian". This
is because Hamilton is a proper noun, and the capitalization transfers to
the term (see here: http://mathworld.wolfram.com/HamiltonianCycle.html).
"hypohamiltonian" should be left lower-case, though.
2. "neccesary" should be "necessary"
3. "non hamiltonian" should be "non-Hamiltonian" (note the dash)
4. "Dodecahedral" should not be capitalized; "dodecahedral"
5. "Running the algorithm on random instances, just to make sure the
answers are still satisfiable path". Should be "paths".
6. "ajacent" should be "adjacent"
7. "Now, we try the algorithm on a non hamiltonian graph, the Petersen
graph" should be "graph: the".
8. "another known hypohamiltonian graph, the generalized Petersen" should
be "graph: the"
Sorry for having to reopen!
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9698#comment:23>
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.
