#14529: Drastic performance improvement of computing the chromatic polynomial
--------------------------------+----------------------------------
Reporter: azi | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.12
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------+----------------------------------
Comment (by darij):
The chromatic polynomial of the empty graph should be 1, not x as your
code returns (nor should it throw a LookupError as the original code did).
While you might want to wait until the {{{is_connected()}}} method
correctly recognizes the empty graph as disconnected, please make sure
that the returned value is actually the polynomial 1, not the integer 1
(so use {{{ZZ['x'].prod}}} instead of {{{prod}}}).
--
Ticket URL: <http://trac.sagemath.org/ticket/14529#comment:16>
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/groups/opt_out.
