cddlib
Library for finding vertices of convex polytopes
cddlib is a C implementation of the Double Description Method of Motzkin et al. for generating all vertices (i.e. extreme points) and extreme rays of a general convex polyhedron in R^d given by a system of linear inequalities.
openSUSE Leap 16.0 jaoks pole ametlikku paketti saadavalVäljalasked
openSUSE Tumbleweed
openSUSE Leap 16.0
openSUSE Leap 15.6
SLFO 1.2
openSUSE Backports for SLE 15 SP7
openSUSE Backports for SLE 15 SP4
SUSE SLE-15-SP1
Mittetoetatud distrod
Järgmisi distrosid ametlikult ei toetata. Kasutage neid pakette omal vastutusel.