#include <gudhi/Simplex_tree.h>
#include <iostream>
int main(int argc, char* const argv[]) {
bool result = false;
std::clog << "Blocker on [";
if (vertex == 6) result = true;
std::clog << vertex << ", ";
}
std::clog << " + 1. ) = " << result << std::endl;
return result;
});
std::clog << "********************************************************************\n";
std::clog <<
"* The complex contains " << stree.
num_simplices() <<
" simplices";
std::clog <<
" - dimension " << stree.
dimension() <<
"\n";
std::clog << "* Iterator on Simplices in the filtration, with [filtration value]:\n";
std::clog << " "
std::clog << std::endl;
}
return 0;
}
void assign_filtration(Simplex_handle sh, Filtration_value fv)
Sets the filtration value of a simplex.
Definition: Simplex_tree.h:625
Dictionary::iterator Simplex_handle
Handle type to a simplex contained in the simplicial complex represented by the simplex tree.
Definition: Simplex_tree.h:175
Filtration_simplex_range const & filtration_simplex_range(Indexing_tag=Indexing_tag())
Returns a range over the simplices of the simplicial complex, in the order of the filtration.
Definition: Simplex_tree.h:338
Simplex_vertex_range simplex_vertex_range(Simplex_handle sh) const
Returns a range over the vertices of a simplex.
Definition: Simplex_tree.h:349
static Filtration_value filtration(Simplex_handle sh)
Returns the filtration value of a simplex.
Definition: Simplex_tree.h:614
std::pair< Simplex_handle, bool > insert_simplex(const InputVertexRange &simplex, Filtration_value filtration=0)
Insert a simplex, represented by a range of Vertex_handles, in the simplicial complex.
Definition: Simplex_tree.h:913
void expansion_with_blockers(int max_dim, Blocker block_simplex)
Expands a simplex tree containing only a graph. Simplices corresponding to cliques in the graph are a...
Definition: Simplex_tree.h:1732
size_t num_simplices()
Returns the number of simplices in the simplex_tree.
Definition: Simplex_tree.h:664