#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: | 2c23fd7aa45b19efe453a64322a5ac196501eb61
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/16214 |
Dependencies: |
#16210 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
No it isn't,my latest comment was a mistake. Because I was thinking of how
the code is written, and it made me think that it would return False on
the following instance :
{{{
sage: Graph([(0,1),(0,1)],multiedges=True).is_hamiltonian()
}}}
Unfortunately, not only does it NOT return "True" as it should, but it
produces another bug. And I am sick and tired of fixing bugs for graphs I
never ever use, i.e. f**** looped graphs with multiples edges.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16214#comment:11>
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.