#18050: Implement dual equivalence graphs
-------------------------------------+-------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: dual equivalence | Merged in:
graphs, sd67 | Reviewers: Darij Grinberg
Authors: Travis Scrimshaw | Work issues:
Report Upstream: N/A | Commit:
Branch: | 09320d95cc880c8fb1ae8a05795c7f9666f56a30
public/crystals/dual_equivalence-18050| Stopgaps:
Dependencies: #18032 |
-------------------------------------+-------------------------------------
Changes (by tscrim):
* dependencies: => #18032
Comment:
That's a much better method to get the colors. I also pulled in #18032
because we needed to get immutable copies of the graph so I could write a
custom cache which does not regenerate the graph when we only want a
different coloring.
I also marked a test as long since it took nearly 20s on my computer.
Someone check my changes please.
--
Ticket URL: <http://trac.sagemath.org/ticket/18050#comment:41>
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.
