#6637: standardize the interface to TransitiveIdeal and friends
-----------------------------------------------------------------+----------
Reporter: nthiery |
Owner: mhansen
Type: enhancement |
Status: new
Priority: major |
Milestone: sage-5.7
Component: combinatorics |
Resolution:
Keywords: backtrack, enumerated set, transitive closure | Work
issues:
Report Upstream: N/A |
Reviewers:
Authors: | Merged
in:
Dependencies: |
Stopgaps:
-----------------------------------------------------------------+----------
Comment (by slabbe):
I think {{{relation}}} would not be too bad for the name of the successor
keyword and should be considered as well. In some sense, a binary relation
is a function {{{f: X -> 2^X}}} and a function is a relation such that
{{{|f(x)|=1}}} for all x.
Possibilities for successor keyword :
- {{{succ}}} : suitable for non symmetric relation, currently used in
{{{TransitiveIdeal}}} and {{{TransitiveIdealGraded}}}
- {{{successors}}} : same comment as succ
- {{{operators}}} : this does not tells me anything, hence I do not like
it.
- {{{neighbors}}} : suitable vocabulary for symmetric relation
- {{{children}}} : suitable vocabulary for non symmetric relation,
currently used in {{{SearchForest}}}.
- {{{relation}}} : I like relation because (1) it does not assume it is
symmetric or not and (2) because this input is what actually define the
studied relation, so I think {{{relation}}} is the best choice for this
keyword up to now.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6637#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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
