#8284: IntervalGraph generator and a bug in is_chordal
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: ncohen
Type: defect | Status: positive_review
Priority: critical | Milestone: sage-4.4.4
Component: graph theory | Keywords:
Author: Nathann Cohen | Upstream: N/A
Reviewer: Robert Miller | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Comment(by ncohen):
Hmmmm.. Anyway creating a RealInterval class wouldn't be a solution as we
would like RealInterval(1,2) == RealInterval(1,2) to be True, which can
not hold if we want the vertices to be different in the Graph :-/
In the end, perhaps the best idea is the one Ed mentionned in one of his
emails : just labels the vertices with (id,(a.b)), and forget about
unnecessary abstraction, which wouldn't add anything in this case...
But then the user creating an interval graph by giving a list of pairs
(a,b) would not be able to guess the name of its vertices, as they would
depend on the id given by IntervalGraph. Of course we can make it number
them according to the order given by the list, but I don't like it very
much either :-/
Any idea ? :-/
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8284#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.
