#18549: Posets: 50x faster is_incomparable_chain_free
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-6.8
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers: Nathann Cohen
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/posets__50x_faster_is_incomparable_chain_free|
58197838580d42c439c5c56369e3e89b597d4e5e
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Description changed by ncohen:
Old description:
> After `P6=Posets(6)` it takes more than 50 seconds to run
>
> {{{
> len([P for P in P6 if P.is_incomparable_chain_free(2,2)])
> }}}
>
> but
>
> {{{
> A=Posets.ChainPoset(2).disjoint_union(Posets.ChainPoset(2))
> len([P for P in P6 if not P.has_isomorphic_subposet(A)])
> }}}
>
> takes less than one second.
New description:
When dot2tex is installed, `P6=Posets(6)` takes more than 50 seconds to
run
{{{
len([P for P in P6 if P.is_incomparable_chain_free(2,2)])
}}}
but
{{{
A=Posets.ChainPoset(2).disjoint_union(Posets.ChainPoset(2))
len([P for P in P6 if not P.has_isomorphic_subposet(A)])
}}}
takes less than one second.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/18549#comment:9>
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.
