#16214: Bug in is_hamiltonian: non-simple digraphs
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_work
Type: | Milestone: sage-6.2
defect | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers: Vincent Delecroix
theory | Work issues:
Keywords: | Commit:
Authors: | 1f3562fcd7b173955dc3d575aefbf9169e3b100c
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/16214 |
Dependencies: |
#16210 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Well... For me a graph with a single vertex and no edges is hamiltonian
too. But really I could not care less, I am pretty sure that all softwares
implement different conventions. For "order == 0", please return the graph
itself. It is just not defined... Actually I would say that for `order <
2` the best is to raise an exception, saying that we have no idea what to
do with those inputs ... If there is no clear definition, the best is to
tell the user that he should settle the draw by himself.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16214#comment:19>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
