#2203: Add a traveling salesman problem solver
----------------------------+-----------------------------------------------
Reporter: jason | Owner: jason
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.3
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Comment(by ncohen):
Here is my dilemma : I first thought of having an argument cycle=True in
is_hamiltonian to make it return the cycle whenever possible, then noticed
that if Graph() would work well anyway, so it wouldn't matter in the end.
The thing is that a hamiltonian_cycle function would be a complete alias
of travelling_salesman_problem, and also that I always feel bad talking
about "cycles" when this function returns a "circuit" (in a digraph). So
from my point of view, hamiltonian_cycle is not meant to be applied to
directed graphs....
Well, if you can find your way through all this... :-)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/2203#comment:15>
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.
