/usr/include/polymake/polytope/cdd_interface.h is in libpolymake-dev-common 3.2r2-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 | /* Copyright (c) 1997-2018
Ewgenij Gawrilow, Michael Joswig (Technische Universitaet Berlin, Germany)
http://www.polymake.org
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version: http://www.gnu.org/licenses/gpl.txt.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
--------------------------------------------------------------------------------
*/
#ifndef POLYMAKE_POLYTOPE_CDD_INTERFACE_H
#define POLYMAKE_POLYTOPE_CDD_INTERFACE_H
#include "polymake/Rational.h"
#include "polymake/Matrix.h"
#include "polymake/ListMatrix.h"
#include "polymake/Vector.h"
#include "polymake/Bitset.h"
#include "polymake/permutations.h"
#include "polymake/polytope/lpch_dispatcher.h"
namespace polymake { namespace polytope { namespace cdd_interface {
template <typename Coord>
class solver {
public:
typedef Coord coord_type;
solver();
~solver();
typedef std::pair< Matrix<coord_type>, Matrix<coord_type> > matrix_pair;
/// @retval first: facets, second: affine hull
matrix_pair
enumerate_facets(const Matrix<coord_type>& Points, const Matrix<coord_type>& Lineality, const bool isCone = false, const bool primal = false);
// FIXME lasst argument necessary as long as lrs uses old format
matrix_pair
enumerate_vertices(const Matrix<coord_type>& Inequalities, const Matrix<coord_type>& Equations, const bool isCone = false, const bool primal = true);
typedef std::pair<Bitset, ListMatrix< Vector<coord_type> > > non_redundant;
/// @retval first: indices of vertices, second: certificates (co-vertices)
non_redundant
find_vertices_among_points(const Matrix<coord_type>& Points);
typedef std::pair<Bitset, Bitset > non_redundant_canonical;
/// @retval first: indices of vertices, second: indices of lineality_space
non_redundant_canonical
canonicalize(const Matrix<coord_type>& Points, const Matrix<coord_type>& InputLineality, bool primal = false);
Bitset
canonicalize_lineality(const Matrix<Coord>& Points, const Matrix<Coord>& InputLineality, bool primal = false);
typedef std::pair<coord_type, Vector<coord_type> > lp_solution;
/// @retval first: objective value, second: solution
// LP only defined for polytopes
lp_solution
solve_lp(const Matrix<coord_type>& Inequalities, const Matrix<coord_type>& Equations,
const Vector<coord_type>& Objective, bool maximize);
};
} } }
#endif // POLYMAKE_POLYTOPE_CDD_INTERFACE_H
// Local Variables:
// mode:C++
// c-basic-offset:3
// indent-tabs-mode:nil
// End:
|