/usr/include/polymake/polytope/hasse_diagram.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 | /* 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_HASSE_DIAGRAM_H
#define POLYMAKE_POLYTOPE_HASSE_DIAGRAM_H
#include "polymake/client.h"
#include "polymake/graph/Decoration.h"
#include "polymake/graph/Lattice.h"
#include "polymake/graph/BasicLatticeTypes.h"
#include "polymake/graph/lattice_builder.h"
#include "polymake/graph/LatticePermutation.h"
namespace polymake { namespace polytope {
using graph::Lattice;
using graph::lattice::BasicDecoration;
using graph::lattice::Sequential;
using graph::lattice::Nonsequential;
// Compute full Hasse diagram of a cone
perl::Object hasse_diagram(const IncidenceMatrix<>& VIF, int cone_dim);
//Compute Hasse diagram of bounded faces of a polytope (possibly up to a dimension)
Lattice<BasicDecoration, Nonsequential> bounded_hasse_diagram_computation(
const IncidenceMatrix<>& VIF,
const Set<int>& far_face,
const int boundary_dim = -1);
perl::Object bounded_hasse_diagram(const IncidenceMatrix<>& VIF,
const Set<int>& far_face,
const int boundary_dim = -1);
perl::Object rank_bounded_hasse_diagram(const IncidenceMatrix<>& VIF,
int cone_dim, int boundary_dim, bool from_above);
inline
perl::Object lower_hasse_diagram(const IncidenceMatrix<>& VIF, int boundary_dim)
{
return rank_bounded_hasse_diagram(VIF, 0,boundary_dim, false);
}
inline
perl::Object upper_hasse_diagram(const IncidenceMatrix<>& VIF, int cone_dim, int boundary_dim)
{
return rank_bounded_hasse_diagram(VIF, cone_dim, boundary_dim, true);
}
} }
#endif
|