#13546: Bug in is_perfect
-------------------------------------------+--------------------------------
Reporter: azi | Owner: jason, ncohen, rlm
Type: defect | Status: needs_review
Priority: critical | Milestone: sage-5.7
Component: graph theory | Resolution:
Keywords: is_perfect,graph theory | Work issues:
Report Upstream: N/A | Reviewers: Jernej Azarija,
Sébastien Labbé
Authors: Nathann Cohen | Merged in:
Dependencies: #8952 | Stopgaps:
-------------------------------------------+--------------------------------
Comment (by azi):
Hello!
Since someone may be using this thing on simple and non-simple graphs and
expect the non-simple case to yield something different than we currently
do (automatically false?) I propose to either
* Document that non-simple graphs are going to be treated as simple
* Simply test at the beginning if the graph is simple and return an
exception if it is not.
I like this last option better since the notion of a perfect graph is
defined for simple graphs so if the user is sending something that is non-
simple it is his problem to handle that!
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13546#comment:20>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
