And LatticePolytope has various compile-time limits like the maximal number of dimension and vertices before you hit a C assertion. Whereas Polyhedron has no limits within your CPU/Memory bounds.
Starting with Sage-5.6 the Polyhedron class also supports the base ring ZZ. In the long run I'm envisioning this as the replacement for the current lattice polytope class. There is also a Cython PPL lattice polytope class at #12553 if you need something very fast. On Saturday, December 29, 2012 2:03:48 PM UTC, Johhannes wrote: > > p.vertices() gives a list of lists, i.e. a list of vertices > Not any more, with sage-5.6 it'll return a list of vertex objects (that behave like lists): sage: polytopes.n_cube(3).vertices() (A vertex at (-1, -1, -1), A vertex at (-1, -1, 1), A vertex at (-1, 1, -1), A vertex at (-1, 1, 1), A vertex at (1, -1, -1), A vertex at (1, -1, 1), A vertex at (1, 1, -1), A vertex at (1, 1, 1)) -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To view this discussion on the web visit https://groups.google.com/d/msg/sage-combinat-devel/-/NefzCQsjxtQJ. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
