#19078: Finite posets: Faster is_antichain_of_poset()
----------------------------------+------------------------
Reporter: jmantysalo | Owner:
Type: defect | Status: new
Priority: minor | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
----------------------------------+------------------------
Changes (by jmantysalo):
* type: enhancement => defect
Old description:
> Implementation in the category of posets works but is unoptimal for
> finite posets. It compares every pair of elements twice, using only
> `le()` function.
New description:
Implementation in the category of posets works but is unoptimal for finite
posets. It compares every pair of elements twice, using only `le()`
function.
Also there is a slight bug:
{{{
P = Posets.PentagonPoset()
print P.is_antichain_of_poset([2,3,'junk'])
print P.is_antichain_of_poset(['junk',2,3])
}}}
Prints `False` and then gives an error.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/19078#comment:1>
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.
