#19024: Posets: Faster order filter and ideal
-----------------------------+----------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.9
Component: combinatorics | Keywords: poset
Merged in: | Authors: Jori Mäntysalo
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+----------------------------------
`breadth_first_search` of (di)graphs accpepts also a list of elements as
an argument, so it is unnecessary to iterate over them in `order_filter()`
and `order_ideal()` on `hasse_diagram.py`.
--
Ticket URL: <http://trac.sagemath.org/ticket/19024>
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.
