#9698: Hamiltonian cycles in undirected graphs - backtracking algorithm.
----------------------------------+-----------------------------------------
Reporter: fidelbarrera | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.5.3
Component: graph theory | Keywords:
Author: Fidel Barrera-Cruz | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------------+-----------------------------------------
Randomized backtracking for finding hamiltonian cycles.
A path P is maintained during the execution of the algorithm. Initially
the path will contain an edge of the graph. Every 10 iterations the path
is reversed. Every ``reset_bound`` iterations the path will be cleared and
procedure is restarted. Every ``backtrack_bound`` steps we discard the
last five vertices and continue with the procedure. The total number of
steps in the algorithm is controlled by ``max_iter``. If a hamiltonian
cycle is found it is returned. If the number of steps reaches ``max_iter``
then a longest path is returned. See OUTPUT for more details.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9698>
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.
