#15875: Add is_subposet
-------------------------------------+-------------------------------------
Reporter: csar | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/csar/ticket/15875 | 7ecc981596c8b9b1cc90fe444a81bfe2bc80b4d6
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
Replying to [comment:11 ncohen]:
> That would be because `Integer(5) == int(5)` returns True, then. Would
you expect them to be handled any differently by posets?
Well, no. So, in principle `P.is_subposet(Q)` can be implemented like
`set([frozenset(x) for x in P.relations()]).issubset(set([frozenset(x) for
x in Q.relations()]))`. Or course there is better ways to do it in
reality.
Is there any graph function already to wrap for this? Something about
reachability in digraphs?
--
Ticket URL: <http://trac.sagemath.org/ticket/15875#comment:12>
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.
