#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 ncohen):
> Again its really the V-representation adjacency matrix; The non-compact
case is just the projectivization. So in a sense its really the vertex
adjacency matrix; I know its somewhat confusing but most people are
interested in the compact case so being overly nitpicky about wording is
going to be confusing too.
So was this line incorrect {{{return Graph(self.vertex_adjacency_matrix(),
loops=False)}}} ?
I expect the `.vertex_graph()` to give me a graph whose vertices are the
vertices of the polyhedron. And the incidence matrix of that graph is
*not* the output of the `_vertex_adjacency_matrix` whose rows are not the
vertices only. Do we agree?
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/18860#comment:18>
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.
