#9698: Hamiltonian cycles in undirected graphs - backtracking algorithm.
----------------------------------+-----------------------------------------
Reporter: fidelbarrera | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-4.5.3
Component: graph theory | Keywords:
Author: Fidel Barrera-Cruz | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------------+-----------------------------------------
Comment(by ncohen):
Replying to [comment:6 rlm]:
> `generic_graph` and `generic_graph_pyx` are for methods which are common
to `Graph` and `DiGraph`. This algorithm is just for undirected graphs.
What there needs to be are `graph_pyx` and `digraph_pyx` files, which
there currently are not.*
Oh... I didn't notice that... Both longest path and hamiltonian cycle make
sense in both settings though, and with some luck writing a version
handling both does not require too much work.
> This is just plain wrong. Any methods you add to the *class*
`GenericGraph_pyx` are inherited by `GenericGraph`, which are then
inherited by `Graph` and `DiGraph`.
After giving it a look, it is indeed plainly wrong. It just shows I added
methods to the file -- and not to the class -- when I edited the file...
Sorryyyyy !! `^^;`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9698#comment:7>
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.
