#17408: Faster transitive_reduction (=> faster Poset creation)
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.5
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: poset | Commit:
Authors: | ce577a909e3ac2835f975cc9515b54459174e8ca
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/17408 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by jmantysalo):
Replying to [comment:10 nbruin]:
> If you're finding that you're creating posets frequently, then you
should make a "lightweight" version of poset that's not carrying around
all the parent baggage.
Maybe we already have this: it is called Hasse diagram?
I mean, can we have a code generating only hasse diagrams and using
functions from `hasse_diagram.py`? I have been computing quite many
calculations of format "Generate posets of size `n`. Remove those that
have property `p`. For remaining compute `f(P)` and then find
smallest/biggest value among results."
--
Ticket URL: <http://trac.sagemath.org/ticket/17408#comment:11>
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.
