#include <iostream>
-#include <libstick-0.1/booleanmatrix.h>
+#include "booleanmatrix.h"
namespace libstick {
class simplex_order {
public:
- typedef boolean_colrowmatrix<IT> boundary_matrix;
+ typedef boolean_colmatrix<IT> boundary_matrix;
/** Create a standard order of the complex c, i.e., the identity permutation. */
simplex_order(const simplcompltype &c) :
return c.simplices[order.at(i)];
}
+ const simplcompltype& get_complex() const {
+ return c;
+ }
+
/** Returns true iff the faces of simplex i are before i in this order. */
bool is_filtration() const {
assert(size() == c.size());
add_simplex(simplex::create_minusonedim_simplex());
}
+ /** Remove all simplices except the dummy simplex */
+ void clear() {
+ simplices.resize(1);
+ }
+
/** Return number of simplices. */
size_t size() const {
return simplices.size();