#16553: Clean IncidenceStructure
-------------------------------------------------+-------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.3
Component: combinatorial designs | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen, Vincent | Reviewers:
Delecroix | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Comment (by ncohen):
> All right, then we need a class `DualDesign` whose points and blocks
would be wrappers. Is it what you want?
No. What I want is to stop trying to solve problems that already have an
easy solution, especially when what you call "solving them" means
sacrificing definitely useful stuff like being able to iterate on blocks.
We can just make the `.dual()` function return a design along with a
dictionary associating a vertex with the block it has become.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16553#comment:6>
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.
