#include <gudhi/Bitmap_cubical_complex.h>
#include <gudhi/Persistent_cohomology.h>
#include <iostream>
#include <sstream>
#include <vector>
int main(int argc, char** argv) {
srand(time(0));
std::cout
<< "This program computes persistent homology, by using bitmap_cubical_complex class, of cubical "
<< "complexes. The first parameter of the program is the dimension D of the bitmap. The next D parameters are "
<< "number of top dimensional cubes in each dimension of the bitmap. The program will create random cubical "
<< "complex of that sizes and compute persistent homology of it." << std::endl;
int p = 2;
double min_persistence = 0;
if (argc < 3) {
std::cerr << "Wrong number of parameters, the program will now terminate\n";
return 1;
}
size_t dimensionOfBitmap = (size_t)atoi(argv[1]);
std::vector<unsigned> sizes;
size_t multipliers = 1;
for (size_t dim = 0; dim != dimensionOfBitmap; ++dim) {
unsigned sizeInThisDimension = (unsigned)atoi(argv[2 + dim]);
sizes.push_back(sizeInThisDimension);
multipliers *= sizeInThisDimension;
}
std::vector<double> data;
for (size_t i = 0; i != multipliers; ++i) {
data.push_back(rand() / static_cast<double>(RAND_MAX));
}
Bitmap_cubical_complex b(sizes, data);
Persistent_cohomology pcoh(b);
std::stringstream ss;
ss << "randomComplex_persistence";
std::ofstream out(ss.str().c_str());
out.close();
return 0;
}