#16892: Function to check if a poset containt a subposet isomorphic to another
poset
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-wishlist
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/function_to_check_if_a_poset_containt_a_subposet_isomorphic_to_another_poset|
f13f2385d2b79adad5dae8282162d776bb8114bd
Dependencies: 16909 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
Yo !
> Ah, it is that easy to convert this to iterator. Points to python!
>
> Now there is `antichains_iterator()` and `antichains()` on posets, and
also for example `lower_covers_iterator()` but not
`closed_interval_iterator()`. Of course there might be technical reason
for that.
Personally I'd vote for turning them all into iterators and having only
one function of each kind.
> E: I think I'll do it in posets.py-hasse_diagram.py -style, because I'm
not sure about rationale behind it. If unsure, do as others...
Come oooooooon. If nobody knows why it is done like that, just do as you
think best ! Don't follow others who followed others themselves.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16892#comment:18>
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.
