#15332: Poset.lt computes too much
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.0
defect | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
combinatorics | Work issues:
Keywords: | Commit:
Authors: | 2bed8dcf4aba1534081a5c047d8f7993e4b3e16f
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/15332 |
Dependencies: |
#15330 |
-------------------------+-------------------------------------------------
Comment (by darij):
Before:
{{{
sage: P = Posets.BooleanLattice(4)
sage: %timeit [P.le(i, j) for i in P for j in P]
1000 loops, best of 3: 847 us per loop
}}}
After:
{{{
sage: P = Posets.BooleanLattice(4)
sage: %timeit [P.le(i, j) for i in P for j in P]
1000 loops, best of 3: 1.13 ms per loop
}}}
There is probably something inefficient about `shortest_path` that was
done better with the breadth-first iterator?
--
Ticket URL: <http://trac.sagemath.org/ticket/15332#comment:3>
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/groups/opt_out.
