#18860: Faster Poyhedron.graph()
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.8
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
geometry | Work issues:
Keywords: | Commit:
Authors: | 74d8412010748142918edf6178636bffdb14e60a
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/18860 |
Dependencies: |
#18779 |
-------------------------+-------------------------------------------------
Comment (by dimpase):
Replying to [comment:12 ncohen]:
> A bit cleaner: I moved the code to the `.graph()`, method for apparently
the `_vertex_adjacency_matrix` is not what it claims to be. Its dimension
may not even be the number of vertices (if you have rays n your
polyhedron) [1].
>
> With this, all tests pass in the `geometry` folder.
Aren't we changing the behaviour of some functions for the non-compact
case?
--
Ticket URL: <http://trac.sagemath.org/ticket/18860#comment:21>
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.
