#18944: Posets: maximal_chains() partial-option broken
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: defect | Status: needs_info
Priority: major | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: posets | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/maximal_chains | e6a4ae2b1f7f887b58a49af5c1607640c7821dde
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by tscrim):
The code seems to be assuming that it is ordered:
{{{
sage: P.maximal_chains(partial=[0,1])
[[0, 1, 3]]
sage: P.maximal_chains(partial=[1,0])
[[1, 0, 1, 3], [1, 0, 2, 3]]
}}}
The documentation says "begins with", that is the saturated part. I'm not
opposed to changing the behavior to removing the saturated condition, but
it would make the code a lot more complex (i.e., likely non-recursive).
--
Ticket URL: <http://trac.sagemath.org/ticket/18944#comment:11>
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.
