#17474: directed graph from polyhedron
-------------------------------------+-------------------------------------
Reporter: chapoton | Owner:
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-6.5
Component: geometry | Resolution:
Keywords: polyhedron, | Merged in:
digraph | Reviewers:
Authors: Frédéric Chapoton | Work issues:
Report Upstream: N/A | Commit:
Branch: u/chapoton/17474 | fa984b9e53f8ed73330a173e27a2c0bf1fdba7d5
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
The thing is that caching costs (in memory) and these methods do not (in
time). So I really do not see the point. Do you agree to also "uncache"
the `vertex_graph` method?
I think that in most cases, the use of cached method is dirty programming
(though it is very cool in development phase).
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/17474#comment:4>
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.
