#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):
Hello !
> {{{
> N5 = Posets.PentagonPoset()
> D = Poset({1:[2,3], 2:[4], 3:[4]})
> for x in isomorphic_subposets(N5, D): print x.cover_relations()
> }}}
>
> Searching for a reason to this...
Could it be because there are multiple ways to send D into N5 ?
> What comes to iterators: They are of course needed when handling large
data. But for quite simple tests it is easier to work with plain list,
sets etc.
True. But you can build a set from an iterator if you like, while if the
function returns a lot of objects you are forced to store them all
whatever you use case is.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16892#comment:20>
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.
