#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;
}