#18944: Posets: maximal_chains() partial-option broken
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.8
Component: combinatorics | Resolution:
Keywords: posets | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/maximal_chains | eeefd9d2c4184a3f60f505a7851ec3ff16eb7bf0
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
As for question 3, just run `sage -t` to `posets.py`.
About 1: How it does that on iterator? But yes, with `BooleanLattice(8)`
it seems to be about 3 times slower to use the function from digraphs.
--
Ticket URL: <http://trac.sagemath.org/ticket/18944#comment:4>
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.
