#11735: Bug in is_chordal
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: tbd
Type: defect | Status: needs_review
Priority: major | Milestone: sage-4.8
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: David Coudert | Author: Nathann Cohen
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Changes (by dcoudert):
* reviewer: => David Coudert
Comment:
Either I don't understand the definition of chordal graphs, or the current
implementation is still incorrect. I did the test with sage-4.8alpha3, so
I assume I don't need to add patch 11738.
{{{
sage: N = 50
sage: NN = 3*N
sage: L = [(3*i, (3*i+1) % NN) for i in xrange(N)] + [(3*i, (3*i+2)%NN)
for i in xrange(N)] + [((3*i+1)%NN, (3*i+2)%NN) for i in xrange(N)]
sage: G=Graph()
sage: G.add_edges(L)
sage: G.is_chordal()
True
sage: G.add_edge(0,15)
sage: G.is_chordal()
True
sage: G.add_edge(0,25)
sage: G.is_chordal()
True
}}}
So, what's wrong ?
David.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11735#comment:6>
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.
