#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 ncohen):
Yooooo !
> I suspect it was done out of dogma: "Parents are supposed to be unique"
in sage.
HMmmm... I am afraid that if I follow the mains lines of what you say, I
have no clue how it is to be implemented in practice. I believe that the
combinat guys use posets as exponents of polynomials, and that this is why
they need a fast equality test. It would be cool if we could remove this
`UniqueRepresentation` dependency from Posets, while letting them have a
way to add it afterwards if they need it in their computations.
We just can't give up enumerating posets up to isomorphism because of this
cached equality test. And lose seconds like in the ticket's description.
Nathann
P.S. : What this ticket does is totally orthogonal to that, though, and
still in `needs_review` `:-P`
--
Ticket URL: <http://trac.sagemath.org/ticket/17408#comment:17>
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.
